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.
Let's consider a sorted array containing all integers from 1 to 101, inclusive. In the worst-case scenario, how many comparison operations will a jump search algorithm perform if the same jump search is employed within each block (instead of using linear search)?
Remember, during the jump search, the initial check starts with the first element.
Hint: You can start by visualizing the blocks within the array and consider the number of steps required to find the target element. Drawing the array on paper and performing a step-by-step analysis may be helpful for beginners.
When calculating for the "worst case", make sure to consider the maximum number of comparisons at each step.