Sorting numbers in linear expected time and optimal extra space

DOI10.1016/0020-0190(82)90043-6zbMath0491.68058OpenAlexW1985889636MaRDI QIDQ1167543

Teofilo F. Gonzalez, Donald B. Johnson

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90043-6

zbMATH Keywords

sorting randomly selected numbers

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (4)

Sorting multisets stably in minimum space ⋮ In-place linear probing sort ⋮ Sorting multisets stably in minimum space ⋮ A space efficient distributive sort

Uses Software

• Quicksort
• Find
• heapsort

Cites Work

• Unnamed Item
• The design and analysis of a new hybrid sorting algorithm
• The analysis of Quicksort programs
• Sorting by distributive partitioning
• Searching and sorting real numbers
• Implementing Quicksort programs
• Internal Sorting by Radix Plus Sifting
• Quicksort

This page was built for publication: Sorting numbers in linear expected time and optimal extra space