The.Algorithm.Design.Manual.Springer-Verlag.1998

Lecture 5 - quicksort
Thus we can sort the elements to the left of the pivot and the right of the pivot independently!
This gives us a recursive sorting algorithm, since we can use the partitioning approach to sort each subproblem.
Listen To Part 5-5
Listen To Part 5-6
Sort(A)
Quicksort(A, low, high)
Partition(A,low,high)
Quicksort(A,1,n)
if (low < high)
pivot = A[low]
leftwall = low
file:///E|/LEC/LECTUR17/NODE5.HTM (3 of 10) [19/1/2003 1:34:35]
Quicksort Animations
Pseudocode
pivot-location = Partition(A,low,high)
Quicksort(A,low, pivot-location - 1)
Quicksort(A, pivot-location+1, high)