next up previous
Next: Pseudocode Up: CSE 2320: Algorithms and Previous: Quicksort

Description

Divide-and-Conquer



Partition A[p..r] into two non-empty subsequences A[p..q] and A[q+1..r] such that each element of A[p..q] is $\leq$ each element of A[q+1..r].



Sort A[p..q] and A[q+1..r] by recursive calls to Quicksort.



Trivial, arrays are sorted in place.



Copyright © 1998 The University of Texas at Arlington