Fibonacci Search

[@vishwasdeshpande3921]

Excellent presentation

[@ZenoDiac]

This is good quality work. You mention the little bits that help with comprehension. Thanks, and well done on producing this video.

[@saranikolic2283]

Thank you! Visualisation really helped me understand Fibonacci method better.

[@The1ceCube]

Thank you! This was explained really well. The visualisation helped me to understand the method a lot better!

[@wellplayed86]

Thank you very much! Such underappreciated content right here! Freak my uni if i need to study all by youtube. Thank god (and you ofc :) ) that your channel exists.

[@alexandrevachon541]

I love the Fibonacci sequence.

[@OscarVeliz]

There seems to be an issue with Creator Studio. I post a comment and but when I refresh the comment disappears.

[@OscarVeliz]

Also try comparing not comparing with z but rather x == 0 and y == 0

[@OscarVeliz]

Lastly if the fractals are working for functions other than arctan then I don't think the zero is causing that issue because that would only impact the starting point in the center. That condition isn't part of the loop.

[@karim8913]

yeah

[@erdem5523]

Thx bro , best

[@montagne13]

good video .. Gracias Oscar

[@rakim7717]

TY my university can't bother to explain it well

[@wellplayed86]

I'm starting to belive that EVERY university doesn't bothering to explain anything nowadays...

[@ericgutierrez8261]

Good video, Oscar. So based on our conversation earlier, it seems like fib search is effective for limiting function calls. For applications or web services that are crunching large datasets and searching for a minimal value of some variable, wonder how effective this algorithm can be due to limiting function calls. Especially while crunching numbers in a cloud service environment that can get costly over time.

[@OscarVeliz]

The answer is always "it depends" but here's my take. The methods I have covered so far all have a linear order so if ternary, dichotomous, or fib are your choices then saving on calls is the best option; go with fib. There are other minimization schemes, like golden-section search, and soon I will cover a superliner order minimization algorithm but it can diverge.

[@alexandrevachon541]

Hello Oscar! I've had some trouble with the Lehmer-Schur algorithm. Can you explain it? It would be helpful!

[@OscarVeliz]

I'll add it to the queue.

[@erdem5523]

Thx bro , best