Fibonacci search

Hey,

The Fibonacci Sequence is defined such that the first two numbers of
the sequence are 0 and 1. subesequent numbers are the sum of the
previous two. e.g.

0, 1, 1, 2, 3, 5, 8, 13 ......

try this for code (googled it)

http://cubbi.org/serious/fibonacci/c++.html

A search returns the N'th fibonacci number (the URL codes it up for
you).


good luck.

G

"Niks" <nbokare@gmail.com> wrote in message
news:1131447873.985860.129610@o13g2000cwo.googlegr oups.com...[color=blue]
> Can anybody explain me what is a "Fibonacci search"?
> even an URL will do.[/color]

http://www.google.com

"Niks" writes:
[color=blue]
> Can anybody explain me what is a "Fibonacci search"?
> even an URL will do.[/color]

Perhaps this will help.

http://en.wikipedia.org/wiki/Fibanocci_Heap

Knuth, Volume 3.
I suppose also CLR?

-vijai.

In message <1131448392.654921.182010@f14g2000cwb.googlegroups. com>,
"Grahamo@nospam.com" <GrahamJWalsh@gmail.com> writes[color=blue]
>Hey,
>
>The Fibonacci Sequence is defined such that the first two numbers of
>the sequence are 0 and 1. subesequent numbers are the sum of the
>previous two. e.g.
>
>0, 1, 1, 2, 3, 5, 8, 13 ......
>
>try this for code (googled it)
>
>http://cubbi.org/serious/fibonacci/c++.html
>
>A search returns the N'th fibonacci number (the URL codes it up for
>you).
>[/color]
That's a Fibonacci sequence. A Fibonacci _search_ is an extension of
the idea of a binary search to the case where you want to find an
extremum rather than a particular value.

--
Richard Herring