https://en.formulasearchengine.com/w/api.php?action=feedcontributions&feedformat=atom&user=122.160.24.75formulasearchengine - User contributions [en]2026-08-31T17:58:49ZUser contributionsMediaWiki 1.47.0-wmf.7https://en.formulasearchengine.com/w/index.php?title=Sloped_armour&diff=6137Sloped armour2013-06-12T08:36:43Z<p>122.160.24.75: /* The cosine rule */</p>
<hr />
<div>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]].<br />
<br />
Time costs for some common heap operations are:<br />
<br />
* ''Delete-min'' takes <math>O(log(n))</math> [[amortized time]].<br />
* ''Decrease-key'' takes constant amortized time.<br />
* ''Insertion'' takes constant amortized time.<br />
<br />
== References ==<br />
<br />
* Tadao Takaoka. [http://www.cosc.canterbury.ac.nz/~tad/2-3heaps.pdf ''Theory of 2–3 Heaps''], Cocoon (1999).<br />
<br />
{{DEFAULTSORT:2-3 heap}}<br />
[[Category:Heaps (data structures)]]<br />
<br />
<br />
{{datastructure-stub}}</div>122.160.24.75