Loading practice questions
Jump search has a worst case time complexity of O(n).
Correct Answer: B — False
Explanation:
The time complexity of jump search is O(n^{1/2}) in worst and average case. It is due to the fact that size of optimal jump is n^{1/2}.