Q.

The complexity of a linear search algorithm is

A. o(n)
B. o(log n)
C. o(n2)
D. o(n log n)
Answer» A. o(n)
1.4k
0
Do you find this helpful?
15

Discussion

No comments yet