Question: 6 . a ) Write a program that implements a slow [O(n 2 )] sort method and a fast [O(nlogn)] sort method. Experiment with your
6. a) Write a program that implements a slow [O(n2)] sort method and a fast [O(nlogn)] sort method. Experiment with your program by running your sort methods using n random numbers as inputs for n=1000, n=10000, n=100000.
Compare the running times by implementing the timer function of the language you are using.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
