Analysis of multiple quickselect variants.

DOI10.1016/S0304-3975(02)00729-6zbMath1044.68034MaRDI QIDQ1401319

Alois Panholzer

Publication date: 17 August 2003

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

zbMATH Keywords

Quicksort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Using nonlinear difference equations to study Quicksort algorithms ⋮ Combinatorial Analysis of Growth Models for Series-Parallel Networks ⋮ Limit laws for the Randić index of random binary tree models

Uses Software

• Quicksort
• Find

Cites Work

• Multiple Quickselect -- Hoare's Find algorithm for several elements
• Probabilistic analysis of multiple quick select
• Special issue: Average-case analysis of algorithms
• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
• Singularity Analysis of Generating Functions
• A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
• Increasing the efficiency of quicksort
• Quicksort
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of multiple quickselect variants.