<ul><li>Quick Sort is a divide and conquer technique.</li><li>Step 1: The first step is to get a pivot element.</li><li>Step 2: Once we get the pivot element, then we create 2 half such that, the elements left to the pivot element are lesser than pivot element.</li><li>In this example, we shall select the lowest element as pivot element.</li><li>By doing the above 2 operations, we make sure that all the elements to the left of pivot element are less and elements to right of pivot are greater.</li><li>Implementation of Quick Sort in C</li><li>In the worst case, the time taken will be O(n^2).</li><li>Steps to select pivot element.</li><li>we swap the elements in their respective positions.</li><li>Similarly, while comparing with the right pointer, we check if the element is greater than the pivot element. If the element is less than the pivot element, we swap the elements.</li></ul>

Sorting algorithm 5: Quick Sort

Discover more