# Jump search has a worst case time complexity of O(n).

+1 vote
Jump search has a worst case time complexity of O(n).

(a) True

(b) False

The question was asked during an interview.

My question is taken from Searching in division Searching of Data Structures & Algorithms II

+1 vote
by (614k points)
selected by

Right option is (b) False

Easy 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.

+1 vote
+1 vote
+1 vote
+1 vote