Heap construction: Optimal in both worst and average cases? (Q6487971): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Repeated random insertion into a priority queue
@@ Property / cites work: Repeated random insertion into a priority queue / rank @@
+Normal rank
@@ Property / cites work @@
+Average-case results on heapsort
@@ Property / cites work: Average-case results on heapsort / rank @@
+Normal rank
@@ Property / cites work @@
+A variant of heapsort with almost optimal number of comparisons
+Normal rank
@@ Property / cites work @@
+Q4763425
@@ Property / cites work: Q4763425 / rank @@
+Normal rank
@@ Property / cites work @@
+Average case selection
@@ Property / cites work: Average case selection / rank @@
+Normal rank
@@ Property / cites work @@
+An average case analysis of Floyd's algorithm to construct heaps
+Normal rank
@@ Property / cites work @@
+On the random construction of heaps
@@ Property / cites work: On the random construction of heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Heaps on Heaps
@@ Property / cites work: Heaps on Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Average case analysis of heap building by repeated insertion
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Building heaps fast
@@ Property / cites work: Building heaps fast / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for manipulating priority queues
@@ Property / cites work: A data structure for manipulating priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
+Normal rank