Let's say there is a sorted array of all integers from 1 to 101, included. What value will jump search take the longest to find?
Don't forget that the check starts with the first element, and when searching in a block, a backward linear search is applied.