ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
Which of the following false about Jump Search?
Correct Answer: D — Jump search starts from the index 0 even though specified index is k
Linear search has O(n) complexity and Binary search has O(logn) complexity, in Jump search you have to jump backwards only once, hence it is preferable if jumping backwards is costly. Jump search starts from index k (specified index) and searches for the element. It won't start searching from index 0.