QuickSort

1- Call quicksort on entire arrayCall partition on entire array

A- - Set up variables for:

a- - - The value of the partition element

b- - - The left and right pointers

c- - - The middle index

B- - Store the value at the middle index of the array (the pivot)

C- - Move it (the pivot) out of the way (swap it with the value at the min index

D- - Set the left and right pointers to min and max indexes

E- - While the left pointer index is less than the right pointer(the pointers have not met)

a- - - While the left pointer index is less than the right pointer and the data at the left index is <= the value of the partition element add 1 to the left pointer (i.e. keep moving the left pointer to the right until you find a value greater than the pivot)

b- - - While the data at the right index is greater than the pivot subtract 1 from the right pointer(i.e. keep moving the right pointer to the left until you find a value less than or equal to the pivot)

c- - - If the left pointer is less than the right pointer (i.e. the pointers have not met)

c1- - - - Swap the values at the left and right pointers (the value > than the pivot moves to the right and the value < the pivot moves to the left

d- - - End while loop

F- - The while loop has completed execution so move the partition element(pivot) into place

G- - Return the value of the right pointer

2- Call quicksort for the left partition(do as above but only for the left partition)

3- Call quicksort for the right partition(do as above but only for the right partition)