On quickselect, partial sorting and multiple Quickselect
type: Item
instance of: scholarly article
title: On quickselect, partial sorting and multiple Quickselect
zbMATH Open document ID: 1185.68284
author: Markus Kuba
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5664481
zbMATH Keywords: algorithms
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: selection
describes a project that uses: Find
describes a project that uses: Quicksort
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.04.003
OpenAlex ID: W1990467142
cites work: Quicksort
cites work: Quickselect and the Dickman Function
cites work: Comparisons in Hoare's Find Algorithm
cites work: Q4507509
cites work: Q5585020
cites work: Linear probing and graphs
cites work: Q5693251
cites work: Binary search tree recursions with harmonic toll functions
cites work: A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
cites work: Multiple Quickselect -- Hoare's Find algorithm for several elements
DOI: 10.1016/J.IPL.2006.04.003
Recommended article: Q2959928
Recommended article: QUICKSELECT revisited
Recommended article: Exploiting partial order with Quicksort
Recommended article: Multiple Quickselect -- Hoare's Find algorithm for several elements
Recommended article: Resilient Quicksort and Selection
Recommended article: Sorting and Selection with Imprecise Comparisons
Recommended article: Sorting and selection on dynamic data
Recommended article: Quickselect and the Dickman Function
description: scientific article; zbMATH DE number 5664481