The following pages link to Average-case results on heapsort (Q1094882):
Displayed 12 items.
- Heaps with bits (Q671419) (← links)
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) (Q688722) (← links)
- An optimal algorithm for deleting the root of a heap (Q750135) (← links)
- A note on constructing min-max heaps (Q1123594) (← links)
- 3 is more promising algorithmic parameter than 2 (Q1125001) (← 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)
- Best case lower bounds for heapsort (Q1195788) (← links)
- Weak-heap sort (Q1314628) (← links)
- Recurrence relations on heaps (Q1913701) (← links)
- Sorting using heap structure (Q2752277) (← links)
- Worst-case analysis of generalized heapsort algorithm revisited (Q3375525) (← links)
- Enumerating solutions to 𝑝(𝑎)+𝑞(𝑏)=𝑟(𝑐)+𝑠(𝑑) (Q4517530) (← links)