Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • 1
    Small note: Java 7 uses Dual-Pivot quicksort only when sorting primitives. To sort objects it uses Timsort. Commented May 5, 2013 at 22:17
  • 1
    +1 for "These days hardly anyone programs their own sorting algorithms anymore" and (more importantly) "Remember: by far the most important performance improvement is when the code goes from "not working" to "working"." However, I would like to know if that overhead is still trivial if, for example, one splits the data set into many, many parts. As it so happens, so have other people: bealto.com/gpu-sorting_intro.html stackoverflow.com/questions/1415679/… devgurus.amd.com/thread/157159 Commented May 8, 2013 at 8:37
  • I'm a little slow. Could anyone explain why it takes 2 * 0.69 more comparisons? Not sure where the 0.69 came from. Commented Feb 24, 2016 at 18:23
  • @jeebface oops, that was a typo (now fixed). It's 0.63 (the reduction in recursion depth), then the result of 26% more also works out. Commented Feb 25, 2016 at 7:36