Reference no: EM133269806

Using the using the rand() function, generate arrays of random 15 bit or 30 bit random integers for n = 1000, 2000, 4000, 8000, 16000, 32000. Time how long cocktailSort, quicksort and mergeSort take. To get an accurate measure for the time for small values of n, you will need to repeat the experiment m times, that is, time how long it takes to sort an array of n values m times and then divide the total time T by m. For example, for n=1000, you may need to repeat the experiment m=100 times so that the total time is at least 1 time unit. For the fast algorithms, you may need to use m=1000 or larger, to get an accurate time T.