how to take a linear complexity in q.2
Quiz on algorithm
Hello @vishal_sangal_123 Hello @vishal_sangal_123 this is because of linked list
in binary search
to find mid we have to traverse the LL hence time complexity of finding mid is O(n) as well
hence overall time complexity is also 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.