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

DOI10.1016/0020-0190(82)90032-1MaRDI QIDQ790618zbMATH OpenOpenAlexFDO

Authors 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) Exact enumeration problems, generating functions (05A15) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 4094834
• A limit theorem for “quicksort”
• scientific article; zbMATH DE number 2130666
• Towards a realistic analysis of some popular sorting algorithms
• Combinatorial analysis of quicksort algorithm

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3255204 (Why is no real title available?)
• Asymptotic Methods in Enumeration
• Continuous models that are equivalent to randomness for the analysis of many sorting algorithms

Cited in

(3)

• On tree-growing search strategies
• A note on the higher moments of the expected behavior of straight insertion sort
• Upper tail analysis of bucket sort and random tries

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

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