Quicksort
The work
| Authors | C. A. R. Hoare |
|---|---|
| Editors | |
| Type | article |
| Year | 1962 |
| Citekey | hoare1962quicksort |
Where it appeared
| Published in | The Computer Journal |
|---|---|
| Volume | 5 |
| Issue | 1 |
| Pages | 10--15 |
Abstract
A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper.
A copy is held
pdf, 3.3 MB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via bibtex |
|---|---|
| Added | 2026-08-05 00:00 UTC |
| Approved by | a person 2026-08-24 07:29 UTC |
Filed under
Cite it as
@article{hoare1962quicksort,
title = {Quicksort},
author = {C. A. R. Hoare},
year = {1962},
journal = {The Computer Journal},
volume = {5},
number = {1},
pages = {10--15},
}
This record lives at https://refs.drheap.org/hoare1962quicksort/ and will keep doing so.