In this exercise you will explore the performance difference between sequential search and binary search. To do so write a program that performs the following tasks: Prompt the user for a file containing 100,000 unsorted integers

Read those integers into an array

Prompt the user for a search item

Search for that item (using sequential search) and report the number of comparisons required.

Sort the array. Note that this will take about a minute.

Search for that item again (using binary search) and report the number of comparisons required.

You will need to modify both of the search functions to report the number of comparisons that were made during the search.

Use your program and the file of 100,000 integers provided here to answer the six questions in the quiz.

Question 1
Question text
Was search item 20000 found?

Select one:
True
False

Question 2
How many comparisons did sequential search make while searching the list for the value 20000?



Question 3
How many comparisons did binary search report in the search for 20000?



Question 4
Was the value 45000 found in this list?

Select one:
True
False

Question 5
How many comparisons were made by sequential search while searching for 45000?



Question 6
How many comparisons were made by binary search while searching for 45000?