Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
71 views
in Information Technology by (120k points)
closed by
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

0 votes
by (121k 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.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...