Pages that link to "Item:Q1108015"
From MaRDI portal
The following pages link to A variant of heapsort with almost optimal number of comparisons (Q1108015):
Displaying 21 items.
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- Optimal heapsort algorithm (Q671366) (← links)
- 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)
- Worst-case analysis of a generalized heapsort algorithm (Q917307) (← links)
- On sorting, heaps, and minimum spanning trees (Q973020) (← links)
- Average-case results on heapsort (Q1094882) (← 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)
- QuickHeapsort, an efficient mix of classical sorting algorithms (Q1608335) (← links)
- Recurrence relations on heaps (Q1913701) (← links)
- Optimizing binary heaps (Q2411045) (← links)
- Sorting using heap structure (Q2752277) (← 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)
- The Analysis of Heapsort (Q3141523) (← links)
- An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop (Q3194717) (← links)
- A Note on HEAPSORT (Q4019942) (← links)
- A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly (Q4039039) (← 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)
