It seems to me like you’ve hit a bug in the JDK since the error seems to come from Swing classes. Options: Define the property java.util.Arrays.useLegacyMergeSort as true. Either using in your code the line System.setProperty(“java.util.Arrays.useLegacyMergeSort”, “true”); before any Swing code. As the first line in the main method should work. Or adding -Djava.util.Arrays.useLegacyMergeSort=true to … Read more
Big-O performance is great for publishing papers, but in the real world we have to look at the constants too. Quicksort has been the algorithm of choice for unstable, in-place, in-memory sorting for so long because we can implement its inner loop very efficiently and it is very cache-friendly. Even if you can implement smoothsort’s … Read more
Java 7 uses Dual-Pivot Quicksort for primitives and TimSort for objects. According to the Java 7 API doc for primitives: Implementation note: The sorting algorithm is a Dual-Pivot Quicksort by Vladimir Yaroslavskiy, Jon Bentley, and Joshua Bloch. This algorithm offers O(n log(n)) performance on many data sets that cause other quicksorts to degrade to quadratic … Read more
TimSort is a highly optimized mergesort, it is stable and faster than old mergesort. when comparing with quicksort, it has two advantages: It is unbelievably fast for nearly sorted data sequence (including reverse sorted data); The worst case is still O(N*LOG(N)). To be honest, I don’t think #1 is a advantage, but it did impress … Read more