Sorting using heap structure (Q2752277): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+A variant of heapsort with almost optimal number of comparisons
+Normal rank
@@ Property / cites work @@
+Average-case results on heapsort
@@ Property / cites work: Average-case results on heapsort / rank @@
+Normal rank
@@ Property / cites work @@
+Heaps with bits
@@ Property / cites work: Heaps with bits / rank @@
+Normal rank
@@ Property / cites work @@
+Heaps on Heaps
@@ Property / cites work: Heaps on Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+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 @@
+Q3219751
@@ Property / cites work: Q3219751 / 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
@@ Property / cites work @@
+The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\)
+Normal rank