Quicksort

Pseudocode
algorithm PARTITION (A, p, r)
//Annahmen: p < r; A[p−1] ≤ min{A[p], . . . , A[r]}
1 x := A[r]; i := p − 1; j := r;
2 while (true)
3 repeat i := i + 1; until (A[i] ≥ x);
4 repeat j := j − 1; until (A[j] ≤ x);
5 if (i < j)
6 swap(A[i], A[j]);
7 else
8 swap(A[i], A[r]);
9 return i;
algorithm QUICK-SORT (A, p, r)
1 if (p < r)
2 q := PARTITION (A, p, r);
3 QUICK-SORT (A, p, q − 1);
4 QUICK-SORT (A, q + 1, r);
2