The complexity of linear search algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer:A
The complexity of linear search algorithm is
A. O(n) B. O(log n) C. O(n2) D. O(n log n)
Explanation: It refers to n values complexity in the algorithm which can be reduced by choosing the other algorithms.