A generalized, one-way, stackless quicksort (Q1094881): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1143814
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Lutz Michael Wegner / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Quicksort / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting a linked list with equal keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort for Equal Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-way, stackless quicksort algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Quicksort programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable Sorting and Merging with Optimal Space and Time Bounds / rank
 
Normal rank

Latest revision as of 12:23, 18 June 2024

scientific article
Language Label Description Also known as
English
A generalized, one-way, stackless quicksort
scientific article

    Statements

    A generalized, one-way, stackless quicksort (English)
    0 references
    0 references
    1987
    0 references
    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.
    0 references
    stackless quicksort
    0 references

    Identifiers