Technology, Algorithms.
in the list is i where n/2i=1. Solving for i gives us i = log(n) so we can say the worst running time of binary search is log(n) which we can rewrite using the asymptotic notation as O(log n). Note that in Linear search, the array/list does not need to be sorted but in Binary Search the array or