Exploiting partial order with Quicksort
From MaRDI portal
Publication:3323281
DOI10.1002/spe.4380140603zbMath0537.68058OpenAlexW2016486355MaRDI QIDQ3323281
Publication date: 1984
Published in: Software: Practice and Experience (Search for Journal in Brave)
Full work available at URL: https://ro.uow.edu.au/compsciwp/46
Related Items (8)
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 ⋮ Sorting shuffled monotone sequences ⋮ A framework for adaptive sorting ⋮ On partitions and presortedness of sequences
This page was built for publication: Exploiting partial order with Quicksort
