[Solved] Java Array.sort algo explanation [closed]

Question

The sorting algorithm for Arrays.sort(int[] a) is a tuned quicksort.
Ref: https://docs.oracle.com/javase/6/docs/api/java/util/Arrays.html#sort(int[])

Read this article: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.14.8162&rep=rep1&type=pdf for understanding the Quick-sort used in Array.sort() by JON L. BENTLEY & M. DOUGLAS McILROY

In Java 7 pivot dual quick-sort algorithm is used for Arrays.sort(int[] a) i.e. refer this: What’s the difference of dual pivot quick sort and quick sort?

Accepted Answer

The sorting algorithm for Arrays.sort(int[] a) is a tuned quicksort.
Ref: https://docs.oracle.com/javase/6/docs/api/java/util/Arrays.html#sort(int[])

Read this article: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.14.8162&rep=rep1&type=pdf for understanding the Quick-sort used in Array.sort() by JON L. BENTLEY & M. DOUGLAS McILROY

In Java 7 pivot dual quick-sort algorithm is used for Arrays.sort(int[] a) i.e. refer this: What’s the difference of dual pivot quick sort and quick sort?