Moves and displacements of particular elements in quicksort

DOI10.1016/j.tcs.2009.01.006zbMath1166.68045DBLPjournals/tcs/MartinezP09OpenAlexW1996568130WikidataQ61734798 ScholiaQ61734798MaRDI QIDQ1019745

Conrado Martínez, Prodinger, Helmut

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.006

zbMATH Keywords

generating functionssortinganalysis of algorithmsquickselectquicksortdata movesdivide-and-conquer recurrences

Mathematics Subject Classification ID

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

Related Items (4)

The analysis of range quickselect and related problems ⋮ Analysis of swaps in radix selection ⋮ Distributional analysis of swaps in quick select ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm

Uses Software

• Quicksort
• Find

Cites Work

• Unnamed Item
• Find
• On quickselect, partial sorting and multiple Quickselect
• Sorting and Selection with Random Costs
• Quicksort

This page was built for publication: Moves and displacements of particular elements in quicksort