While I know this seems obvious I’ll explain my confusion. I’ve always thought of Quicksort’s worst case time complexity as O(n^2). The documentation for Arrays.sort(int[]) from Java 7 to Java 13 says: This algorithm offers O(n log(n)) performance on many data sets that cause other quicksorts to degrade to quadratic performance, and is typically faster… Read More What is the worst case time complexity of Java 14+ Arrays.sort( int[] )?