Quick Sort Algorithm


(Team) #1
Quicksort algorithm is a comparison sort algorithm based on Divide and Conquer strategy. It has an average performance of O(n*log(n)) and is considered as one of the most efficient sorting algorithms in general case.

The average case time complexity is O(N log N) and the auxiliary space complexity is O(N); O(log N) (Sedgewick).

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/quick-sort/