In-place merge sort should be faster in unsorted case, but I've never seen an implementation that I understood, much less understood the proof it's really O(n log n).
Better than which algorithm? It's optimal big-O and very fast when input is already [almost] sorted.
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.