The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) (Q1186810): Difference between revisions

@@ Property / Wikidata QID @@
+Q56049342
@@ Property / Wikidata QID: Q56049342 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+Deleting the root of a heap
@@ Property / cites work: Deleting the root of a heap / rank @@
+Normal rank
@@ Property / cites work @@
+An average case analysis of Floyd's algorithm to construct heaps
+Normal rank
@@ Property / cites work @@
+Building heaps fast
@@ Property / cites work: Building heaps fast / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:1186810