Sorting in linear expected time
type: Item
instance of: scholarly article
title: Sorting in linear expected time
zbMATH Open document ID: 0576.68050
DOI: 10.1007/BF01935365
author: M. T. Noga
author: D. C. S. Allison
published in: BIT
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3921995
zbMATH Keywords: statistical sorting
zbMATH Keywords: hybrid sorting
zbMATH Keywords: distributive partitioning
zbMATH Keywords: quicksort
describes a project that uses: Quicksort
MaRDI profile type: Publication
cites work: Implementing Quicksort programs
cites work: Sorting by distributive partitioning
cites work: Average time behavior of distributive sorting algorithms
cites work: Some performance tests of convex hull algorithms
cites work: The design and analysis of a new hybrid sorting algorithm
cites work: Q4194455
cites work: Usort: An efficient hybrid of distributive partitioning sorting
cites work: Q4091421
description: scientific article; zbMATH DE number 3921995