ISRO2007-59

Question

The time taken by binary search algorithm to search a key in a sorted array of $n$ elements is

• A. $O\: (\log_2 \: n)$
• B. $O \:  (n)$
• C. $O \: (n \: \log_2 \: n)$
• D. $O \:  (n^2)$

Answer 1

A     O(logn)

Answer 2

Binary search is always for sorted array , and it takes A) O(log n) time for searching an element

Answer 3

Binary Search Algorithm takes O(log n) time in order to search an element in the array of sorted list...