why time complexity of inbuilt binary search is linear with size
Binary search inbuilt functiom
Time complexity for binary search in arrays is logarithmic.
For linked lists they are linear.
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.