C++: You are to compare two sorting algorithms and compare two searching algorithms by running the algorithms and collecting data on each. Your data for sorting and searching will be strings of 15 characters in length. You are to have you r program run, compute and print all the results in one run, not multiple runs. (You are to run your program once for all data sets.)

First Part:

The two sorts to compare are the Bubble Sort and the Selection Sort. You are to test your sorts against different sets of strings. Each sort will sort six sets of data, 1000 strings, then 3000 strings, 5000, 7000, 9000 and 11000 strings. You will compare how well each sort did with the different data sizes and show results. I would like to see a plot of the results. A table format showing results will do. Use the time function and the difftime function to gather sort times or the clock function shown in the handout. Show answers with at least 4 places to right of decimal point.

Second Part:

The two searches to use for comparisons are the Linear Search and the Binary Search. You will search for 3000 random strings in the array of 11000 strings array only and compute the average number of probes (not time) needed to find a match. The target string will be a randomly selected string from the 11000 strings data set. You will select randomly 3000 strings for testing each search algorithm. Output the average number of probes needed for each search algorithm.

Third Part:

How does your two search algorithms compare with the theoretical values?

You are to generate random strings of 15 characters in each string for your string data sets. Below is code to build one (1) random string.

Hint:

char charset[52]; a b c A B C Z;

string randomstr;

for ( i = 1; i <=15; i++ )

{ randomndx = rand() % 56; // random index into array charset.

randomstr = randomstr + charset[ randomndx ]; //concat a char to the string begin built

// you are building a string one char at a time.

// The code above builds only one string.

}

To select a random string form the 11000. How? You will generate a random number 0 to 10999, an index into the 11000 string array, use the selected string to do a Search. Now, generate a new random number as an index into the 11000 array and search again. Do this for 3000 times.