scientific article; zbMATH DE number 176500

zbMATH Open0764.68084MaRDI QIDQ4035664FDOQ4035664

Authors: Ingo Wegener 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\)
• A lower bound for the worst case of bottom-up-heapsort
• A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort
• An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons
• Best case lower bounds for heapsort
• scientific article; zbMATH DE number 4213429
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• On the Best Case of Heapsort
• Worst-case analysis of generalized heapsort algorithm revisited

zbMATH Keywords

worst case complexityHEAP SORTQUICK SORT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cited In (3)

• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• A lower bound for the worst case of bottom-up-heapsort
• An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons

This page was built for publication:

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