Towards a Realistic Analysis of the QuickSelect Algorithm

We revisit the analysis of the classical QuickSelect algorithm. Usually, the analysis deals with the mean number of key comparisons, but here we view keys as words produced by a source, and words are compared via their symbols in lexicographic order. Our probabilistic models belong to a broad catego...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory of computing systems Jg. 58; H. 4; S. 528 - 578
Hauptverfasser:	Clément, Julien, Fill, James Allen, Nguyen Thi, Thu Hien, Vallée, Brigitte
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.05.2016 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithms Asymptotic properties Categories Combinatorics Complexity Computer Science Constants Data Structures and Algorithms Discrete Mathematics Information Theory Mathematics Symbols Texts Theory of Computation Selection problem Permutations Quickselect Probabilistic analysis of algorithms Sorting and searching algorithms Asymptotic estimates Rice’s method Pattern matching Information theory
ISSN:	1432-4350, 1433-0490
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!