Quicksort Speed Test
Write a program that does this:
Start: How many data items do you want in each test file?
[get a number]
[creates best.txt , worst.txt , and average.txt]
Reads each data set from file, into an array or vector.and runs Bubble Sort on all three, and runs Quicksort on all three.
Reports results in elapsed seconds in a table like this:
Best Case Average Case Worst CaseBubble Sort 2 sec. 2.87 sec. 3.219 sec.Quicksort 0 sec. 0.012 sec. 0,311 sec.Then go back to start to offer another run.
Note: Be careful to RELOAD the data into array after each sort runYou MUST have comments throughout your code where needed.Extra Credit: compile statistics over multiple runs and report them.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here