On Fri, 14 Dec 2007, Henning Thielemann wrote: > Worst case analysis of AVL trees also leads to Fibonacci numbers, as far > as I remember.
The number of possibilities to arrange bricks of a certain width is also Fibonacci number. In general I think that Fibonacci numbers serve as simple non-trivial example for difference equations. | | || -- || -- ||| |-- --| ||| |-- --| ... _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe