Splitsort -- an adaptive sorting algorithm

DOI10.1016/0020-0190(91)90181-GzbMath0735.68021MaRDI QIDQ1182101

Christos Levcopoulos, Ola Petersson

Publication date: 27 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

measures of presortednessnumber of inversions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (5)

Sorting multisets stably in minimum space ⋮ A framework for adaptive sorting ⋮ Exploiting few inversions when sorting: Sequential and parallel algorithms ⋮ The weak-heap data structure: variants and applications ⋮ Adaptive sorting: an information theoretic perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encroaching lists as a measure of presortedness
• Sorting shuffled monotone sequences
• A new measure of presortedness
• Sublinear merging and natural mergesort
• Measures of Presortedness and Optimal Sorting Algorithms
• Exploiting partial order with Quicksort

This page was built for publication: Splitsort -- an adaptive sorting algorithm