+1 vote
in Data Structures & Algorithms II by (110k points)
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 Answer

+1 vote
by (614k points)
selected by
 
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...