A Race between Selection sort and Bubble sort Implement both selection sort and bubble sort, so that they sort an array of strings into ascending order. Accept a number form the command line, and create two identical copies of an array of random ten character strings of that length. Measure how long selection sort takes to sort one array. Measure how long bubble sort takes to sort the other copy. Repeat the experiment for a number of different array sizes, and provide some meaningful conclusions about the algorithms' relative speeds. Here is a special timing function you can include. #include  #include  double get_cpu_time() { struct rusage ruse; getrusage(RUSAGE_SELF, &ruse); return ruse.ru_utime.tv_sec+ruse.ru_utime.tv_usec/1000000.0 + ruse.ru_stime.tv_sec+ruse.ru_stime.tv_usec/1000000.0; } Example run: a.out 10000 It took 3.179 seconds for selection sort to sort 10000 strings It took 3.330 seconds for bubble sort to sort the same strings. 

this might be helpful hint that is needed to be used in the code :-

#include #include #include #include using namespace std; double get cpu time() struct rusage ruse; getrusage (RUSAGE_SELF, &ruse); return ruse.ru utime.tv sec+ruse.ru utime.tv usec/1000000.0+ ruse.ru stime.tv sec+ruse.ru stime.tv usec/1000000.0: void selection_sort (string A[], int N) int sum = 0; for (int i - 0 i N; i +- 1) for (int j =0; j <>