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

DOI10.1016/0020-0190(82)90032-1zbMath0534.68043OpenAlexW2052109527MaRDI QIDQ790618

Ernst-Erich Doberkat

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90032-1

zbMATH Keywords

Bernoulli numbersaverage case analysishigher momentsinsertion sort

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15)

Related Items (2)

A note on the higher moments of the expected behavior of straight insertion sort ⋮ On tree-growing search strategies

Cites Work

• Continuous models that are equivalent to randomness for the analysis of many sorting algorithms
• Asymptotic Methods in Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort