This MUST be in simple C++ coding for data structures and run in code blocks. If you have any questions please ask!!
- Wrie a program that will generate a list of 10000 numbers stored in an array with values 1 and 500
- Print out any original 200 numbers to show the results(not one number per line either)
- Now sort the number using bubble sort
- Sort the original numbers again using a Selection sort
- Sort the original numbers again using a quick sort
- How many swaps were made in the bubble sort, the selection sort, and in the quick sort?
- Now look up 1000 random numbers using linear search on the original data and then
- search for 1000 numbers using the binary search. Determine the average number of probes that
- each search algorithm takes.
- Do the search values represent the theoretical values? Print out the averages for the two searches and their theoretical values.