Fibonacci Search (Ascending) | Search Algorithm

The Code can be found at:

I do not claim to own any of the code explained in the video unless I explicitly mention that I own the code. It is usually inspired by various websites and I have tried to make some of my own changes for the sake of this tutorial.

Send me an email or comment below if you want to be credited.

[atharvatirkhunde]

Literally I was searching for the video who can explain fibonacci search in detail I couldn't find it I was ignoring your video but it was the best

[shyamgaikwad]

coolest and "THE ONLY " proper video on fibonacci
thank you so much

[ritvikpatil]

Excellent and perhaps the ONLY video for clearly understanding Fibonacci search

[patrikviera]

Nice to see a new video by you after so long.

[TECHnicalEra]

🤣🤣🤣 I love the Daaas .. (Pause) What the fuck am i saying😂

[breezl]

Thanks for the nice video.

I wonder if there is a small flaw ：

When arr = [5], k = 5, then m =1 and fibonaccigenerator (1 - 1) = 0
This code "return offset + 1" will not be executed
And you will get the wrong answer -1

[janhavikotulkar]

Thank you very much u have just cleared all my doubts.

[sengoku]

This way is quite not that good since you have to recalculate your fib. num every step of the loop. What I used and find the best solution is to use cache to store the fibanacci calculated nums from 1 up to the one we need at the first time and then just iterate through it backwards. This way it works fast but requires some memory. Gl to all coders out there!

[FurstyRazor]

Thanks for the nice video. Finally understood the Fibonacci-Search :)
What is the compiler you are using?