Quick Sort Algorithm –Explanation, Implementation, and Complexity
5
Quick Sort also uses divide and conquer technique like merge sort, but does not require additional storage space. It is one of the most famous comparison based sorting algorithm which is also called as partition exchange sort. Like merge sort, it also use
