i think answer should be d option because time complexity of binary search is logn.
Regarding queston 2
since it is list type object
the access to elements is sequential hence even binary search cannot randomly access middle element like we can do for array
hence the time complexity is O ( 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.