There's a Fibonacci Heap: <a href="http://en.wikipedia.org/wiki/Fibonacci_heap">http://en.wikipedia.org/wiki/Fibonacci_heap</a><div><br></div><div>Not sure what else though :)<br><br><div class="gmail_quote">On Mon, Aug 16, 2010 at 11:14 PM, Antoine Latter <span dir="ltr"><<a href="mailto:aslatter@gmail.com">aslatter@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div class="im">On Mon, Aug 16, 2010 at 1:37 PM, Andrew Coppin<br>
<<a href="mailto:andrewcoppin@btinternet.com">andrewcoppin@btinternet.com</a>> wrote:<br>
><br>
> This neatly leads us back to my second assertion: In all my years of<br>
> computer programming, I've never seen one single program that actually<br>
> *needs* the Fibonacci numbers in the first place (let alone in<br>
> arbitrary-precision).<br>
><br>
<br>
</div>I think there are variants on AVL trees that use something related to<br>
a Fibonacci sequence for balancing. I don't remember the details,<br>
though.<br>
<font color="#888888"><br>
Antoine<br>
</font><div><div></div><div class="h5">_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</div></div></blockquote></div><br></div>