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

DOI10.1016/0020-0190(82)90032-1zbMATH Open0534.68043OpenAlexW2052109527MaRDI QIDQ790618FDOQ790618

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

Recommendations

• scientific article
• 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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Upper tail analysis of bucket sort and random tries
• A note on the higher moments of the expected behavior of straight insertion sort

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)