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
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/