What is the worst case complexity of binary search using recursion? – McqOptions

MCQOPTIONS

1.	What is the worst case complexity of binary search using recursion?
A.	O(nlogn)
B.	O(logn)
C.	O(n)
D.	O(n<sup>2</sup>)
Answer» C. O(n)

Discussion

No Comment Found

Related MCQs

What is the time complexity of binary search with iteration?
Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?
Binary Search can be categorized into which of the following?
Which of the following is not an application of binary search?
What is the average case time complexity of binary search using recursion?
WHAT_IS_THE_AVERAGE_CASE_TIME_COMPLEXITY_OF_BINARY_SEARCH_USING_RECURSION??$
What_are_the_applications_of_binary_search?$
What is the worst case complexity of binary search using recursion?
Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?