Q109
Best case of jump search will have time complexity of . . . . . . . .
A.
O(1)
AnswerB.
O(n)
C.
O(log n)
D.
O(n log n)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board