A generalized, one-way, stackless quicksort
type: Item
instance of: scholarly article
title: A generalized, one-way, stackless quicksort
zbMATH Open document ID: 0631.68056
DOI: 10.1007/BF01937353
published in: BIT
publication date: 1987-01-01T00:00:00Z
review text: This note generalizes the one-way, stackless quicksort of Huang and Knuth to work for any type of sort key. It thus proves that quicksort can run with mininal space in O(N log N) average time.
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4026842
zbMATH Keywords: stackless quicksort
author: Lutz Michael Wegner
describes a project that uses: Quicksort
MaRDI profile type: Publication
cites work: Quicksort
cites work: Q4133077
cites work: A stable quicksort
cites work: Sorting a linked list with equal keys
cites work: Quicksort for Equal Keys
cites work: A one-way, stackless quicksort algorithm
cites work: Implementing Quicksort programs
cites work: Stable Sorting and Merging with Optimal Space and Time Bounds
Recommended article: A one-way, stackless quicksort algorithm
Recommended article: Q4728256
Recommended article: A fully vectorized quicksort
Recommended article: Quicksort revisited
Recommended article: A generalization of the zero-one principle for sorting algorithms
Recommended article: An only-once-sorting algorithm
Recommended article: Q3134582
Recommended article: An intuitive and simple bounding argument for Quicksort
description: scientific article; zbMATH DE number 4026842