With version 7 of Java, Oracle replaced its tried and tested sorting algorithm in the Java runtime library by an entirely new Quicksort variant proposed by Vladimir Yaroslavskiy. The decision to change the sorting method was based on empirical studies showing that the new algorithm is faster than the formerly used classic Quicksort. Surprisingly, this improvement is achieved with a dual-pivot approach-an idea considered not promising by theoretical studies in the past. In this book, we try to shed some light on the unexpected success by mathematically analyzing the new algorithm's...