1.

(a) Write a computer program to randomize integers 1 through 9999.

(b) Write computer programs to sort these numbers in the increasing order using the following algorithms

(i) Exchange sort

(ii) Insertion sort

(iii) Selection sort

(iv) Quick sort

(v) Merge sort

(vi) Bubble sort

Attached sheets give the pseudo algorithms for the first five approaches. In the computer program use a command which print outs the computer time used [One typically uses the library file or in newer version of c++ compiler and uses the function clock (see cplusplus.com/ref/ctime for some explanation.

(c) Rerun the programs with random integers from 1 through 99999. See if you are able to make some conclusions about the efficiency of various sorting approaches.