Write a program to find the number of comparisons using the binary search and sequential search algorithms as follows:
Suppose list is an array of 1000 elements.
a. Use a random number generator to fill list.
d. Print the number of comparisons for Steps c.i and c.ii. If the item is found in the list, then print its position.
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.