Pages that link to "Item:Q3718164"
From MaRDI portal
The following pages link to An average case analysis of Floyd's algorithm to construct heaps (Q3718164):
Displaying 13 items.
- Batcher's odd-even exchange revisited: a generating functions approach (Q290531) (← links)
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) (Q688722) (← links)
- Average-case results on heapsort (Q1094882) (← links)
- On the random construction of heaps (Q1108784) (← 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)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- A stochastic interpretation of propositional dynamic logic: expressivity (Q2892686) (← links)
- (Q4993558) (← links)
- Heap construction: Optimal in both worst and average cases? (Q6487971) (← links)
