Ninja Sort
Someone has registered the www.ninjasort.com/ domain, claiming that:
It’s still under development, but it’s gonna be big!
Naturally, the java community is highly skeptical. Currently the algorithm on the NinjaSort page is ridiculous looking, impossible to understand, and only as good as insertion sort. For more information about neat new sorting algorithms, you should read this paper about an O(n log log n) parallel sorting algorithm.
Personally, I am not going to try writing a new sorting algorithm in my spare time. It’s been proven that comparison sorting takes at least O(n log n) time, so that recourse is gone. Computer Scientists have basically conclude that generic sorting, which must compare elements by definition, can’t get any better. So how can this guy, or anyone, ever think to write a better one?
| This entry was posted on Wednesday, March 2nd, 2005 at 8:42 pm and is tagged with sorting algorithm, insertion sort, computer scientists, sorting algorithms, java community, recourse, spare time, ninja, elements. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback. |
3 Responses to “Ninja Sort”
Leave a Reply
Ninja Sort rocks.
Psssshhhhh… it’s ridiculous!
There’s no perfect sorting algorithm yet, not even in the O(n log n) group.
If NinjaSort manages to have O(n log n) time complexity, and also O(n log n) memory complexity and also be stable and also not be a possible victim of DOS attacks like quicksort, THEN it will indeed kick the *** out of every other sorting algorithm!!