A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort (Q4950608): Difference between revisions

@@ Property / author @@
-Rezaul Alam Chowdhury
@@ Property / author: Rezaul Alam Chowdhury / rank @@
-Normal rank
@@ Property / author @@
+Rezaul Alam Chowdhury
@@ Property / author: Rezaul Alam Chowdhury / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160008804896
+Normal rank
@@ Property / OpenAlex ID @@
+W2061153095
@@ Property / OpenAlex ID: W2061153095 / rank @@
+Normal rank
@@ Property / cites work @@
+A variant of heapsort with almost optimal number of comparisons
+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 @@
+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 @@
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:4950608