Comparing Binary and Hash Search, programming homework help

Hello,

first of all, this assignment has attached files which is final project file.

the red starts are the most important things in my assignment.

the third star need the print the size and the benchmark values. ( either time or count ) up to you.

the last star is the extra credit part. all the files you need in this part are in final project document.

Note ( the forth start is about an essay. this essay should explain the result of the assignment without the extra credit part. )

Note ( Extra credit part has its own essay to explain. so when you finish this part, you could write a separate essay just for extra credit programming part. )

if you have any question before you begin, please let me know.

thanks

Due: Monday, May 8, 2017 by 11:00am
If not turned in by 11:15am, lose 10 points and no extra credit will be counted
If not turned in by 12:00pm, lose 20 points and no extra credit will be counted’
If not turned in by 3:00pm, no credit
Create a function that will generate a list of random numbers. Be sure the numbers are in random
order. The function should accept a number that represents the size of the list and return the list.
* Modify the Bubble sort, Insertion sort and Shell sort functions to perform benchmark analysis on each of
these functions. You can use some type of counting such as comparisons and/or swaps or you could use
time. These files are located in the 1:\kopp\outbox\CS 222 01\Final Project folder.
* Run the benchmark analysis on each sorting function for list sizes of 100, 1000, and 10000. Print the size
and the benchmark values (time or counts).
Write an essay discussing your results. Be sure to explain your results completely and thoroughly. In
your conclusion, determine which, if any, of the sorting techniques are better. *
Add the following comments to the beginning of the program.
Name:
Your Name
Class and Section: CS 222 01
Assignment:
Final Project
Due Date:
See above
Date Turned in:
Program Description: You write a short description of what the program will do
When you complete the program, do the following.
1. Create a folder with the following name: FinalProject
2. Copy your program to this folder
3. Copy the folder to your folder in the 1:\kopp\inbox\CS 222 01 folder
*Extra Credit: 10 points
Use the binaryList.txt file located in the folder mentioned above. You will need to read the numbers
into a list. Run a for loop 20 times searching for the 20 numbers located in the binaryLook.txt file.
Analyze these searches using comparison.
Use the hashList.txt file located in the folder mentioned above. Using the hash search (remainder
method), move the numbers from the file to a hash list. Suggested size for the hash list is 1171. Once
the list is created, use the hash function to search for 20 numbers found in the hashLook.txt file.
Analyze these searches using comparison, Write an essay completely explaining the two search
methods.