Pages that link to "Item:Q688722"
From MaRDI portal
The following pages link to BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) (Q688722):
Displaying 15 items.
- Weak heaps engineered (Q396692) (← links)
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- Heaps with bits (Q671419) (← links)
- Multiway in-place merging (Q964398) (← links)
- On sorting, heaps, and minimum spanning trees (Q973020) (← links)
- The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) (Q1186810) (← links)
- QuickHeapsort, an efficient mix of classical sorting algorithms (Q1608335) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- Optimizing binary heaps (Q2411045) (← links)
- Sorting using heap structure (Q2752277) (← links)
- FAT HEAPS WITHOUT REGULAR COUNTERS (Q2846479) (← links)
- An in-place heapsort algorithm requiring<i>n</i>log<i>n</i>+<i>n</i>log*<i>n</i>−0.546871<i>n</i>comparisons (Q2885554) (← links)
- STRONGER QUICKHEAPS (Q3016226) (← links)
- A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort (Q4950608) (← links)
- Heap construction: Optimal in both worst and average cases? (Q6487971) (← links)
