Programming project

Generate 100,000 integers using random method. Measure the required time to sort
these number using:
1. bubble sort
2. insertion sort
3. selection sort
4. merge sort
5. default sorting algorithm (if it is different than the provided above)
To better measurement, repeat each of the experiments at least 20 times and take
the average time spent in sorting.
Analyze the required time in sorting using each of these algorithms and write a
one-page report along with their best-case and worst-case time complexities of
these algorithms.
Submit your report along with the source code of your program. You can use the
sorting algorithm implementations from other resources as long as the reference is

Powered by WordPress