Vary the parameter max_simple_sort_size and test quick_sort using randomly
generated lists of size n = 10,000. What value of max_simple_sort_size produces
the fewest swaps? Do not forget to count the swaps in interchange_sort. Does
this value of max_simple_sort_size also produce the shortest actual running
time? If time permits, see if the results change when n is increased to 100,000.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here