When to use Binary Search?

Can anyone please tell me how do they figure out that a particular question is solvable by the binary search? Last few questions in D&C I have implemented binary search, and it worked. Still, I don’t get feeling that in the contest i will know I have to apply binary search just by reading the question. Maybe these questions are in D&C that’s why my brain always thinks of implementing binary search…

What is some other approach we can use to solve a question which is solvable by binary search?

PS: I think these questions always come in the mind of beginners so it will be helpful if we discuss it.

binary search is applicable when you have to find minimum or maximum in a continuos increasing fuctions

it means that if x increases then f(x) should also increase or decrease, it means should be monotones

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.