...case.

We note that the parallel version of Quicksort requires more memory than a good implementation of the sequential version. In particular the sequential version can be implemented in place while the parallel version requires about n scratch space.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...nesting.

The current HPF 1.0 has some limited support for nested calls and future versions are likely to have significantly better support.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.