Sorting numbers in linear expected time and optimal extra space
type: Item
instance of: scholarly article
title: Sorting numbers in linear expected time and optimal extra space
zbMATH Open document ID: 0491.68058
DOI: 10.1016/0020-0190(82)90043-6
author: Teofilo F. Gonzalez
author: Donald B. Johnson
published in: Information Processing Letters
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 3772963
zbMATH Keywords: sorting randomly selected numbers
describes a project that uses: Find
describes a project that uses: Quicksort
describes a project that uses: heapsort
MaRDI profile type: Publication
full work available at URL: 0020-0190(82)90043-6
OpenAlex ID: W1985889636
cites work: Sorting by distributive partitioning
cites work: Searching and sorting real numbers
cites work: Quicksort
cites work: Q4057549
cites work: Internal Sorting by Radix Plus Sifting
cites work: The design and analysis of a new hybrid sorting algorithm
cites work: The analysis of Quicksort programs
cites work: Implementing Quicksort programs
description: scientific article; zbMATH DE number 3772963