Encroaching lists as a measure of presortedness

DOI10.1007/BF01954895zbMath0663.68082MaRDI QIDQ1115201

Steven S. Skiena

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

permutationssortingpresortednessencroaching listsmelsort

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Discrete mathematics in relation to computer science (68R99)

Related Items

A framework for adaptive sorting ⋮ Randomized adaptive sorting ⋮ An optimal parallel adaptive sorting algorithm ⋮ Splitsort -- an adaptive sorting algorithm ⋮ Right invariant metrics and measures of presortedness ⋮ A note on adaptive parallel sorting ⋮ Sorting shuffled monotone sequences ⋮ A framework for adaptive sorting ⋮ A new measure of presortedness ⋮ On partitions and presortedness of sequences

Cites Work

• A Computer Algorithm for Calculating the Product AB Modulo M
• The parallel complexity of exponentiating polynomials over finite fields
• A method for obtaining digital signatures and public-key cryptosystems
• Unnamed Item