, Volume 26, Issue 1, pp 127-130

A one-way, stackless quicksort algorithm

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This note describes a sorting technique that is similar to the well-known “quicksort” method, but it is undirectional and avoids recursion. The new approach, which assumes that the keys to be sorted are positive numbers, leads to a much shorter program.

The preparation of this paper was supported in part by National Science Foundation grant DCR-83-00984. The authors thank the referees for several important suggestions.