Moves and displacements of particular elements in quicksort

DOI10.1016/J.TCS.2009.01.006zbMATH Open1166.68045DBLPjournals/tcs/MartinezP09OpenAlexW1996568130WikidataQ61734798 ScholiaQ61734798MaRDI QIDQ1019745FDOQ1019745

Authors: Conrado Martínez, Helmut Prodinger 

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

Recommendations

• Average-case analysis of moves in Quick Select
• The analysis of range quickselect and related problems
• Measuring post-quickselect disorder
• Analysis of quickselect : an algorithm for order statistics
• Distributional analysis of swaps in quick select

zbMATH Keywords

analysis of algorithmsgenerating functionsquickselectquicksortsortingdata movesdivide-and-conquer recurrences

Mathematics Subject Classification ID

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

Cites Work

• Find
• Quicksort
• Title not available (Why is that?)
• On quickselect, partial sorting and multiple Quickselect
• Sorting and Selection with Random Costs

Cited In (6)

• Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
• Measuring post-quickselect disorder
• Distributional analysis of swaps in quick select
• Analysis of swaps in radix selection
• The analysis of range quickselect and related problems
• An analysis of selection sort using recurrence relations

Uses Software

• Quicksort
• Find

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019745)