How to implement the algorithm of the Fibonacci search?

Good time of day. I did a lot of digging on the Internet and don't quite understand one thing.
Search using the Fibonacci what is it like? I made a very simple program, and at first I thought that this is the same search.. But began to doubt and confused at the end.
The program itself is simple and works, but in fact it is just the Fibonacci numbers..
Then how to make the algorithm search using the algorithm Fibonacci?

For clarity, even a screenshot attached :)
5e9b967f3f26f886245641.jpeg

And that those who find it difficult to understand my question. This task which I cannot perform. By the way I'm not asking to perform the task, and would just like to know what kind of search algorithms which I can't do and the Internet is no example. If someone in the teeth this and can help I would really appreciate it!

To develop a software module demonstration compare the performance of search algorithms by using Fibonacci algorithm and the algorithm according to Bohr.

Thank you for this thread!
April 19th 20 at 12:47
3 answers
April 19th 20 at 12:49
this algorithm is almost everywhere and at every step!
almost all examples of recursion show the examples of factorial and Fibonacci

the algorithm in pseudo language:
fibonaсci func(x) {
 // Handling the extreme case, exit recursion
 if (x < 2) {
 return x
}

 // recursion (calling itself)
 return fibonaсci(x-1) + fibonaсci(x-2)
}

fibonaсci(10) // 34
This is not a search! - lesley_Roberts32 commented on April 19th 20 at 12:52
April 19th 20 at 12:51
April 19th 20 at 12:53
Optimized version of the search in both directions

Find more questions by tags Windows FormsC#Algorithms