Intelligent Quotes

Quicksort

In this paper, Tony Hoare, introduced Quicksort, a revolutionary sorting algorithm based on a divide-and-conquer strategy.

More about Tony Hoare →

Summary

The algorithm recursively partitions an array around a pivot element, sorting elements in place without additional memory. Hoare’s partitioning method—using two pointers moving inward—is especially efficient and robust.

Details

• Title: Quicksort

• Author: Tony Hoare

• Type: Article

• Journal: Communications of the ACM, Volume 4, Issue 7

• Publisher: Association for Computing Machinery (ACM)

• Publication time: July 1, 1961

• Publication place: New York, United States

• Link: https://www.cs.ox.ac.uk/files/6226/H2006%20-%20Historic%20Quicksort.pdf

People also read