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 101, inclusive, what value will both linear and jump searches find at the same time (in terms of number of comparisons), excluding the first number?
Remember that the jump search begins its check with the first element.
Hint: To find the common value found by both linear and jump searches, you can visualize the process of searching through the array. Drawing the array and tracking your steps on paper can be a helpful approach, especially for beginners.