Wow! This problem is kind of tricky. If you're ready to put your thinking cap on, brace yourself, and good luck! Otherwise, you can skip it for now and return any time later.
In a sorted array containing all integers from 1 to 98, inclusive, which value will take the longest (in terms of number of comparisons) for jump search to find?
Remember that the search starts with the first element, and the square root is rounded down to the nearest integer (i.e., smaller integer).
Hint: To identify the value that will take the longest for jump search to find in this sorted array, you can visualize the search process. Drawing the array and keeping track of your steps on paper can be a valuable approach, particularly for those new to the concept.
Consider the characteristics of jump search and the rounding behavior of square roots as you analyze the array.