Revision as of 00:08, 20 November 2023 edit Jacobolus (talk \| contribs) Extended confirmed users 40,160 edits 'mid' priority in math wikiproject ← Previous edit		Revision as of 01:09, 9 January 2024 edit undo Cewbot (talk \| contribs) Bots 8,375,843 edits 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}}. Next edit →
Line 1: ~~{{Vital article\|class=C\|topic=Mathematics\|level=5}}~~ {{WikiProject Mathematics\|class=C\|priority=mid}}▼ {{WikiProject Computer Science\|class=C\|importance=high}}▼ == Unifying heaps == Line 65 ⟶ 62: [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~~\|class=C~~\|priority=mid}} ▲{{WikiProject Computer ~~Science\|class=C~~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)

Talk:Heap (data structure): Difference between revisions