Comparison of Search Algorithms

Create a program to compare the number of iterations required to find a number from an array of 1000 ordered random numbers using Ordered list search and Binary search. This program should list the number of iterations reuired using ordered list search and the number of iterations required using Binary search. Required Steps: 1. Read 1000 sorted values from a file into an array. You can create a file in Excel. 2. Create functions to search the array using ordered list search and binary search. 3. Program should prompt user for a number to search. 4. Program should call the ordered list search function and the binary search function. If target is found it displays the number of iterations used in the Binary Search and the number of iterations used in Oredered list search. If target is not found, it should list the number of iterations used to determine that the number is not in the array using both functions. Also display the message that the target is not found. 5. At the end of each search, the program should come back and ask the user for another number to search - the program should end when the user enters the number 0. ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Deadline information I must have it completed by Friday, November 30 2001, at latest, Saturday November 01, 2001