The time complexity of binary search is O(logn).

Related MCQs

• The complexity of Binary search algorithm is
• The complexity of Binary search algorithm is
• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is
• The complexity of linear search algorithm is
• What additional requirement is placed on an array, so that binary search may be used to locate an entry?
• Binary search algorithm cannot be applied to
• Which of the following is not the required condition for binary search algorithm
• Which of the following is not a limitation of binary search algorithm ?
• Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?