template <typename T>
void
quicksort(T a[], size_t left, size_t right) {
if (right > 1 + left) {
const size_t mid = partition(a, left, right);
quicksort(a, left, mid);
quicksort(a, mid + 1, right);
}
}
This page last modified on 24 January 2006.