Q68
What is the worst case for linear search?
A.
O(nlogn)
B.
O(logn)
C.
O(n)
AnswerD.
O(1)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board