Encroaching lists as a measure of presortedness
From MaRDI portal
Publication:1115201
DOI10.1007/BF01954895zbMath0663.68082MaRDI QIDQ1115201
Publication date: 1988
Published in: BIT (Search for Journal in Brave)
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