Weak-heap sort (Q1314628): Difference between revisions

@@ Property / describes a project that uses @@
+heapsort
@@ Property / describes a project that uses: heapsort / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+Q3796732
@@ Property / cites work: Q3796732 / 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 @@
+Q3359743
@@ Property / cites work: Q3359743 / rank @@
+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
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01990520
+Normal rank
@@ Property / OpenAlex ID @@
+W2042509780
@@ Property / OpenAlex ID: W2042509780 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1314628