Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSearch algorithms

Jump search

Theory

Find the element

Report a typo

Below is an array of 14 integers:

{ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233 }

Find the element 2121 using jump search. Write the number of comparisons that you needed to run in order to find it. The jump length has the optimal value, and you should begin comparing with the first element of the array.

Note: To calculate block sizes, use the floor function, not the ceil function!

Enter a number
___

Create a free account to access the full topic