Content deleted Content added
m Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Merge {{VA}} into {{WPBS}}. Keep majority rating "C" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Mathematics}}, {{WikiProject Computer Science}}. |
|||
| (2 intermediate revisions by 2 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=C|vital=yes|1=▼
{{WikiProject Mathematics|priority=mid}}▼
{{WikiProject Computer science|importance=high}}▼
}}▼
== Unifying heaps ==
Line 62 ⟶ 66:
[http://en.wikipedia.org/w/index.php?title=Fibonacci_heap&oldid=321861430#Summary_of_running_times Fibonacci queue] cites [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8133 this paper]. From the abstract:
▲{{WikiProject banner shell|class=C|vital=yes|1=
▲{{WikiProject Mathematics|priority=mid}}
▲{{WikiProject Computer science|importance=high}}
▲}}
{{cquote|An implementation of priority queues is presented that supports the operations MakeQueue, FindMin, Insert, Meld and DecreaseKey in worst case time O(1) and DeleteMin and Delete in worst case time O(log n). The space requirement is linear. The data structure presented is the first achieving this worst case performance.}}
I think this should be mentioned here. [[User:Paradoctor|Paradoctor]] ([[User talk:Paradoctor|talk]]) 12:01, 7 November 2009 (UTC)
Line 215:
I'm not a specialist, but is the first image (https://en.wikipedia.org/wiki/Heap_(data_structure)#/media/File:Max-Heap.svg) correct? In the "array representation" part (at image bottom) shouln't be slot with value "17" connecting with "2" and "7", instead of slot with value "3"?
[[User:Joint ventura|Joint ventura]] ([[User talk:Joint ventura|talk]]) 18:37, 11 February 2021 (UTC)
:(For the record), there was apparently a glitch, which [https://en.wikipedia.org/w/index.php?title=Heap_(data_structure)&diff=prev&oldid=1007288576 got fixed 6 days after you noticed it]. [[User:AHMartin|AHMartin]] ([[User talk:AHMartin|talk]]) 17:55, 15 January 2024 (UTC)
== Is "almost complete" correct? ==
Line 221 ⟶ 223:
(In addition, even for binary heaps, "almost complete" excludes the "perfect" case, which doesn't seem right at all.)
--[[Special:Contributions/66.189.60.1|66.189.60.1]] ([[User talk:66.189.60.1|talk]]) 01:09, 7 May 2021 (UTC)
:Given the existance of the (linked) article [[binary heap]], this Heap page has no business discussing the details of binary heap implementations. Also, the nomenclature variants for "complete", "perfect", "full", etc. binary trees are discussed in the (linked) article [[Binary tree#Types_of_binary_trees|Binary tree § Types_of_binary_trees]]. But since "almost complete" is a variant characterization of the tree underlying a binary heap's implementation, I changed it to "complete". Now this article uses the term consistently. [[User:AHMartin|AHMartin]] ([[User talk:AHMartin|talk]]) 18:36, 15 January 2024 (UTC)
| |||