The complexity of Binary search algorithm is

Options
- O(n)
- O(log n)
- O(n2)
- O(n log n)

CORRECT ANSWER : O(log n)

Discussion Board
Data Structure - Binary Search Algorithm

Binary search is a fast search algorithm with run-time complexity of ?(log n). This search algorithm works on the principle of divide and conquer.

Prajakta Pandit 02-1-2017 11:06 PM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲