Technique #1:
Divide-and-Conquer
l
Rearrange the array to be sorted:
l
Low elements on the bottom
l
High elements on the top
l
Use some element as the ÒpivotÓ value
l
Sort the low and high portions recursively
l
Called ÒquicksortÓ
l
Invented by C.A.R. (Tony) Hoare