A one-way, stackless quicksort algorithm

DOI10.1007/BF01939369MaRDI QIDQ1082079zbMATH OpenOpenAlexFDO

Authors Bing-Chao Huang, Donald E. Knuth

Publication date 1986

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01939369

zbMATH Keywords

sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Review text

This note describes a sorting technique that is similar to the well-known quicksort method, but it is undirectional and avoids recursion. The new approach, which assumes that the keys to be sorted are positive numbers, leads to a much shorter program.

Recommendations

• A generalized, one-way, stackless quicksort
• Publication:4728256
• Quicksort revisited
• A quicksort algorithm base on radix
• Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures

Cites work

• Quicksort

Cited in

(7)

• A generalized, one-way, stackless quicksort
• A note on synthesis and classification of sorting algorithms
• scientific article; zbMATH DE number 1820029 (Why is no real title available?)
• A quicksort algorithm base on radix
• Quicksort revisited
• An only-once-sorting algorithm
• scientific article; zbMATH DE number 4003539 (Why is no real title available?)

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: A one-way, stackless quicksort algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082079)