Just wanted to share some useful content on binary search with the people here at codeforces!
Binary search is best visualized as searching for a value X at which F(X) = Y where "F" is some function.
This notion of binary search can help efficiently evaluate:
->Local minima and Local maxima of a function.
you can evaluate things like:
highest point for a projectile using binary search
nth root of a number.
Cost minimization techniques like gradient descent and binary search play a crucial role in machine learning.
Here is a short playlist which outlines the essence of binary search in detail with lots of real-life examples and 6 interesting problems that can be solved with binary search.
link: https://www.youtube.com/playlist?list=PLb3g_Z8nEv1jH8cmcMrx_6MuM_KC_LIan
Do share some fun real-life applications of binary search in comments!
