On the adaptiveness of Quicksort

DOI10.1145/1227161.1402294zbMath1365.68190OpenAlexW2109426391MaRDI QIDQ5269283

Gerth Stølting Brodal, Gabriel Moruz, Rolf Fagerberg

Publication date: 15 June 2017

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1227161.1402294

zbMATH Keywords

adaptive sortingQuicksortbranch mispredictions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Randomized algorithms (68W20)

Related Items (5)

The weak-heap data structure: variants and applications ⋮ Integrating Pareto optimization into dynamic programming ⋮ Quicksort ⋮ Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm ⋮ Complexity analysis and performance of double hashing sort algorithm

This page was built for publication: On the adaptiveness of Quicksort