Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by Tony Hoare in 1959, with his work published in 1961, it is still a commonly used algorithm for sorting. When implemented well, it can be about two or three times faster than its main competitors, merge sort and heapsort.


Quicksort Provider

Provider for quicksort solutions. Used for demonstration and testing purposes.


No data refining solutions available yet. Please contact the provider for more information about the release schedule.