Imagine you have a sorted array containing all integers from 1 to 101 (both inclusive). Your task is to arrange the given numbers in ascending order, based on the number of comparisons operations required to find them.
Tip: Note that here the jump search begins with the first array element. That is, the first comparison (check) is made the element 1.