The surprising history of sorting development in the JDK
summary
History of JDK sorting: explains how primitive-type sorting used classic single-pivot Quicksort until JDK 7 introduced the speaker-proposed Dual-Pivot Quicksort (1.5–3.5× faster) and how Timsort replaced merge sort for objects. Describes the optimizations and techniques applied to Dual-Pivot Quicksort over the past 14 years, performance improvements, and how to properly test sorting implementations.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 2:29Sorting history in JDK
- 8:14Dual-Pivot QuickSort development
- 12:53Insert sort optimization
- 16:10Pivot selection
- 22:50Floating-point sorting
- 26:52Parallel sorting in JDK
- 31:11Best sort selection
- 36:36Sorting evolution in JDK
- 40:58Conclusion
related talks
47mHow the JVM Optimizes Generic Code - A Deep Dive
30mComparison Method Violates Its General Contract! (Part 2)
51mJava Performance Update: From JDK 21 to JDK 25
48mCollections.compare(JDK, Eclipse, Guava, Apache...);
41mUp and Away: JDK Optimizations
57mStay Ahead with Java’s Latest Features in JDK 23
44mIncremental Improvements to the Java Platform
39mMost impacting features of newest JDKs