Below is an array of integers containing 14 elements.
{ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233 }You want to check whether the element 234 is present in the array using the jump search.
What is the minimum number of comparisons of the target element with array elements to do it?
The jump length has the optimal value. You start comparing with the first element of the array.