Math, asked by jatinagrawal6175, 10 months ago

The Complexity Of Binary Search Algorithm Is

Answers

Answered by Anonymous

Answer:

hey mate here is your answer..

Step-by-step explanation:

Time Complexity of Binary Search Algorithm is O(log2n).

Here, n is the number of elements in the sorted linear array. This time complexity of binary search remains unchanged irrespective of the element position even if it is not present in the array.

hope it helped...

Previous Question

Next Question

Similar questions

Math, 5 months ago

If (x1, y1) is equidistant from the points (a+b,b-a) and (a- b,a+b) then show that ayı = bx1...

English, 5 months ago

poem on fitness beats pandemic ...

Math, 5 months ago

What single discount is equivalent to two successive discounts of 30% and 10%?

Physics, 10 months ago

A Block Of Mass 10Kg, moving in x direction with a constant speed of 10 ms-1, is subjected to a retarding force F = 0.1 x J/m during its travel from x = 20 m to 30 m. Its final KE will be:...

Math, 10 months ago

If g (x) = 1 + √x and f (g (x)) = 3 + 2√x + x then, f (x) is equal to (a) 1 + 2x² (b) 2 +x² (c) 1 +x (d) 2 +x...

English, 1 year ago

The purpose of this inquiry is to get___ the facts...

Biology, 1 year ago

name the deposit fall in human body...

Math, 1 year ago

Find two numbers, if Their sum is 3 and their difference is 21...