why cant we use Find func in a sorted array. How is it inefficient?
Binary search in built func
We can use Find function in a sorted array. But we are not utilizing the fact that the array is sorted and we can do the search in Log(n) time.
Find function would do the search in O(N) time, because it would keep on traversing the array linearly till the element is found.
Binary Search would do the search in Log(N) . If we are at i’th index, we can discard the either half of the array.
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.