Sloped armour: Difference between revisions

Revision as of 10:36, 12 June 2013

In computer science, a 2–3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2–3 tree.

Time costs for some common heap operations are:

@@ Line 1: / Line 1: @@
-Hi there, I am Andrew Berryhill. The preferred hobby for him and his children is to perform lacross and he would by no means give it up. My day job is an invoicing officer but I've currently applied for an additional one. For a whilst I've been in Mississippi but now I'm contemplating other choices.<br><br>Also visit my web-site; spirit messages - [http://Www.Route41.com/excellent-advice-for-choosing-the-ideal-hobby/ route41.com] -
+In [[computer science]], a '''2–3 heap''' is a [[data structure]], a variation on the [[heap (data structure)|heap]], designed by [[Tadao Takaoka]] in 1999. The structure is similar to the [[Fibonacci heap]], and borrows from the [[2–3 tree]].
+Time costs for some common heap operations are:
+* ''Delete-min'' takes <math>O(log(n))</math> [[amortized time]].
+* ''Decrease-key'' takes constant amortized time.
+* ''Insertion'' takes constant amortized time.
+== References ==
+* Tadao Takaoka.  [http://www.cosc.canterbury.ac.nz/~tad/2-3heaps.pdf ''Theory of 2–3 Heaps''], Cocoon (1999).
+{{DEFAULTSORT:2-3 heap}}
+[[Category:Heaps (data structures)]]
+{{datastructure-stub}}