What is the time complexity of my solution?

If I make n calls to binary search , does it mean my complexity is n*logn based on my solution

Yes…binary search runs in logn time…so calling it n times means the complexity is n log n

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.