Continuous models that are equivalent to randomness for the analysis of many sorting algorithms

DOI10.1007/BF02247934zbMath0504.68037MaRDI QIDQ1836306

Ernst-Erich Doberkat

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

sortinganalysis of algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort

Cites Work

• Implementation and Analysis of Binomial Queue Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Continuous models that are equivalent to randomness for the analysis of many sorting algorithms