1. 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 1,000 elements.

a. Use a random number generator to fill list.

b. Use any sorting algorithm to sort list. Alternatively, you can use the function insert0rd to initially insert all the elements in the list.

c. Search the list for some items, as follows:
     i. Use the binary search algorithm to seach the list. (You might need to modify the algorithm given in this chapter to count the number of comparisons.)
     ii. Use the binary search algorithm to search the list, switching to a sequential search when the size of the search list reduces to less than 15. (Use the sequential search algorithm for a sorted 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.