The complexity of a linear search algorithm would be:
A. O(n2)
B. O(n log n)
C. O(n)
D. O(log n)
Answer:C
The complexity of a linear search algorithm would be:
A. O(n2) B. O(n log n) C. O(n) D. O(log n)