Computer Science, asked by Anonymous, 2 months ago

CS_MCQ
Best or ideal case complexity for a linear search algorithm is ______.
a) O(log n)
b) O(n)
c) O(1)
d) O(n log n)

Answers

Answered by vineetsingha252

1

Answer:

a . O ( log n )

Explanation:

Answer: a

Explanation: The worst case complexity of linear search is O(n).

Previous Question

Next Question

Similar questions

Math, 1 month ago

file:///C:/Users/admin/Pictures/HJ.PNG WHATS ITS CORRECT ANSWER...

English, 1 month ago

what is signed douctment submitted to an officer regarding her personal information...

Chemistry, 1 month ago

Find the odd one from the following set ornament, gold, sugar, oxygen...

Biology, 2 months ago

Give reasons for the following: (a) Mushroom is a saprotroph. (b) Sun is the ultimate source of energy for all living organisms. (c) The leaf of a plant dies out if its stomata are blocked. (d) Leaf is known as the food factory of the plant. 11...

Science, 2 months ago

Robert sprays water on the veggies in the produce section to “plump them up diffusion or osmosis explain...

Biology, 10 months ago

3 main organs that make up the plant body.

English, 10 months ago

Goa has many beautiful beaches...

English, 10 months ago

Try to compose a poem for grandparents birthday...