Randomized adaptive sorting

DOI10.1002/rsa.3240040103zbMath0787.68029OpenAlexW2085544944MaRDI QIDQ4034707

Vladimir Estivill-Castro, Derick Wood

Publication date: 16 May 1993

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240040103

zbMATH Keywords

randomized algorithmsadaptive sortingQuicksortsorting algorithmsMerge SortSkip Sort

Mathematics Subject Classification ID

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

Related Items (1)

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encroaching lists as a measure of presortedness
• A new measure of presortedness
• Measures of Presortedness and Optimal Sorting Algorithms
• Exploiting partial order with Quicksort
• A List Insertion Sort for Keys With Arbitrary Key Distribution

This page was built for publication: Randomized adaptive sorting