When an object does not occur in an array, a sequential search for it must examine the entire array. If the array is sorted, you can improve the search by using the approach described in Exercise 2. A jump search is an attempt to reduce the number of comparisons even further. Instead of examining the n objects in the array a sequentially, you look at the elements a[ j], a[2j], a[3j], and so on, for some positive j > n. If the target t is less than one of these objects, you need to search only the portion of the array between the current object and the previous object. For example, if t is less than a[3j] but is greater than a[2j], you search the elements a[2j + 1], a[2j + 2], . . ., a[3j - 1] by using the method in Exercise 2. What should you do when t > a[k * j], but (k + 1) * j < n? Devise an algorithm for performing a jump search. Then, using [√n] as the value of j, implement the jump search.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.