adplus-dvertising
frame-decoration

Question

What is the time complexity of binary search with iteration?

a.

O(nlogn)

b.

O(logn)

c.

O(n)

d.

O(n^2)

Answer: (b).O(logn)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the time complexity of binary search with iteration?

Similar Questions

Discover Related MCQs

Q. When is the uniform binary search an optimization over the usual binary search?

Q. Given delta[4] is a global array and number of elements in the sorted array is 10, what are the values in the delta array?

Q. What is the time complexity of uniform binary search?

Q. Given, arr = {1,3,5,6,7,9,14,15,17,19} key = 17 and delta = {5,3,1,0}
How many key comparisons are made?(exclude the comparison used to decide the left or right sub array)

Q. How can Jump Search be improved?

Q. Which of the following false about Jump Search?

Q. Which algorithmic technique does Fibonacci search use?

Q. Choose the recursive formula for the Fibonacci series.(n>=1)

Q. What is the time complexity of Fibonacci Search?

Q. What are the advantages of Fibonacci Search?

Q. What is the length of the step in jump search?

Q. What is the time complexity of Jump Search?

Q. What is an in-place sorting algorithm?

Q. In the following scenarios, when will you use selection sort?

Q. What is the worst case complexity of selection sort?

Q. What is the advantage of selection sort over other sorting techniques?

Q. What is the average case complexity of selection sort?

Q. What is the disadvantage of selection sort?

Q. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,

Q. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,