Thread: JavaScript like sort algorithm?

I like the compare function to sort complex thing, its easy to do and undestand

C's qsort function also takes a compare function, except that being a lower level language, it isn't as easy to do and understand.

they said JavaScript's sort is the fastest sorting algorithm ever, is that right?

I don't know JavaScript, but I would suspect sort is a method, not an algorithm. I would expect it to use internally some sorting algorithm. (That is, I don't see a reason why the sort routine in other languages couldn't be implemented using the same algorithm.)

C's qsort function, as the name implies, should be an implementation of the quicksort algorithm. C++'s sort function may be implemented using any sorting algorithm that meets the complexity/behaviour requirements (but there is no reason to assume STL implementors wouldn't choose the best algorithms available).

But you can be sure that a general-purpose sorting algorithm cannot be faster than a special-purpose algorithm for specific situations. For example, you can sort integers (in a limited range?) with linear complexity O(n), whereas a general sorting algorithm can never be better than O(n * log n).