Question: The above file contains implementation of sequential search and binary search. You will use program to compare the performance of these two search techniques. Run

The above file contains implementation of sequential search and binary search. You will use program to compare the performance of these two search techniques.
Run the code few times and see what is going on. The program determines the execution times for binary search and sequential search for different list sizes.
Evaluate the algorithm. After starting the program give the values as in the following interactions.( the list sizes number of iterations may need to be adjusted to ensure that the exections end in a reasonable amount of time.)
Enter start list size: 100000
Enter end list size: 200000
Enter list size increment: 10000
Enter number of iterations for sequential search: 100
Enter number of iterations for binary search: 1000
Why would you run binary search many more times than sequential search?
 The above file contains implementation of sequential search and binary search.
You will use program to compare the performance of these two search

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!