This lab is due by Friday, July 22, 2022 11:59 PM.
As with all labs you may, and are encouraged, to pair program a solution to this lab. If you choose to pair program a solution, be sure that you individually understand how to generate the correct solution.
Instructions
We will now see the benefit of all our sorting work.
To get started, prompt the user to enter the number of integers to store in a list. Then generate n
random integers. Finally, sort the list into ascending order.
Now we'll have the user give us a target value to search for. Implement the binary search algorithm discussed in class using an iterative solution - not the recursive solution provided.
To test your implementations, perform the following steps:
- Ask the user how many integers to enter
- Ask the user for the smallest value to generate
- Ask the user for the largest value to generate
- Create a list of
nintegers - Assign each element a random value within the range provided (inclusive)
- Print the list forwards
- Sort the list ascending
- Print the list forwards
- Ask the user how many target values they wish to search for
- For each target value entered by the user, perform an iterative binary search to find the target. If the target is found, then print the position the target first appears at. If the target is not found, then print -1.
Lab Submission
Submit your main.cpp, Makefile, *.hpp, *.h, *.cpp file(s).
You will submit your solution to this lab with the rest of Set5. Detailed instructions for doing this are posted in Assignment 5.
This lab is due by Friday, July 22, 2022 11:59 PM.
As with all labs you may, and are encouraged, to pair program a solution to this lab. If you choose to pair program a solution, be sure that you individually understand how to generate the correct solution.