Binary Search is used to find an element in a sorted array. Complexity of binary search algorithm is log(N), where N is size of the sorted array. At each step of Binary Search we keep on dividing the array into half and try to find the required element in oneā¦

Continue reading

0