Practical C Programming

Quick sort

This method takes an array or subarray into consideration. It invokes the method to find the pivot of the array or subarray and splits the array or subarray on the basis of the pivot. Here is its syntax:

Quick Sort (arr,n)

Here, arr is the array consisting of n elements.

This is how we use this method:

1. Let l=1 and u=n, where l and u represent the lower and upper index location, respectively, of the array.
2. Push l into stack1.
3. Push u into stack2.

4. While stack1 or stack2 is not empty, repeat steps 5 through 10.
5. Pop the lower index location of the array from stack1 into variable s, that is, s becomes the lower index location of the array to be sorted.
6. Pop the upper index location from stack2 into the variable e, that is, the e variable ...