12 12 votes The time taken by binary search algorithm to search a key in a sorted array of $n$ elements is $O\: (\log_2 \: n)$ $O \: (n)$ $O \: (n \: \log_2 \: n)$ $O \: (n^2)$ Algorithms isro2007 algorithms binary-search time-complexity + – go_editor 12.1k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 8 8 votes A O(logn) Sanjay Sharma answered Jun 10, 2016 • selected Apr 25, 2017 by Deepthi_ts Sanjay Sharma comment Share Follow 0 reply Please log in or register to add a comment.
7 7 votes Binary search is always for sorted array , and it takes A) O(log n) time for searching an element srestha answered Jun 10, 2016 srestha comment Share Follow 0 reply Please log in or register to add a comment.
2 2 votes Binary Search Algorithm takes O(log n) time in order to search an element in the array of sorted list... akash.dinkar12 answered Apr 8, 2017 akash.dinkar12 comment Share Follow 0 reply Please log in or register to add a comment.
