Algorithms

by Sedgewick Robert

• The entry a[j] is in its final place in the array, for some j. • No entry in a[lo] through a[j-1] is greater than a[j]. • No entry in a[j+1] through a[hi] is less than a[j]. We achieve a complete sort by partitioning, then recursively