Answer of Question 2 , should be option 4, since time complexity of binary search is o[logn]
Answer Correction in Algorithm Stl#2 quiz
Yes you are correct.Some of the answers are marked wrong. We are working on it.
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.