Computer Science, asked by akashp12, 6 months ago

Q:11 The complexity of Binary search algorithm is
O O(n)
O(log)
0(n^2)
O(n log n)

Answers

Answered by lCandycaneMissyl

0

Answer:

b is the correct answer..

Answered by Anonymous

1

Explanation:

The complexity of Binary search algorithm is (log)

Previous Question

Next Question

Similar questions

Math, 3 months ago

Page Ne +977 - 16 nz २१५ IEERyx. PM PL...

Math, 3 months ago

Answer the Question if you know ...

English, 3 months ago

she opened door & found a global chain (make it simple sentence) ...

Math, 6 months ago

Q.1.(A) Choose the correct alternative answer for the following questions. (4 Marks) (1) The ratio of sides of two similar triangles are 4 : 9 . What is the ratio of their areas? (a) 2:3 (b) 4:9 (c) 81:16 (d) 16:81 (2) Out of the following which is the Pythagorean triplet ? (a) (1, 5, 10) (b) (3, 4, 5) (c) (2, 2, 2) (d) (5, 5, 2) (3) In ∆QSR, m∠Q = 45°, m∠S = 90° and SR = 4, find QS. (a) 3 (b) 4...

Math, 6 months ago

Shabir can finish a work in 18 days and Moin can do the same work in half the time taken by Shabir .working together, how much work will they complete in2 days...

English, 11 months ago

i palne ___ at 2:00 ( arrives , will arrive ...

English, 11 months ago

B 3) Find the synonyms for the following words from i) continue ii) a period of two weeks - iii) grand appearance - iv) dries up- B 4) 1) We saw the majestic ocean. (Change the sentence into 'Present Perfect Tense 2) It leaves me in complete awe. (Add a question ta B 5) Why should we protect our nature?

Math, 11 months ago

solve.............??,!,!,,!!,!,!,!,!,!,,!,!,,!!,!,!,!,!,,!,,!,! 13x-6=7...