Task A

?read from a file, one set of 1000 random values to be sorted and repeat 1000:

o sort data using the iterative sort

?record the total time used for the 1000 calls

?repeat the above steps using the quick sort algorithm.

================ ( 0 InserSort, 0 QuickSort).



Task B

?Repeat the steps in Task A using this time a set of input data of size 5000

================ ( 0 InserSort, 0 QuickSort).



Task C

?Repeat the steps in Task A using this time a set of input data of size 5000 already

sorted.