Write some Software

Write a program that attempts to make the Radix Sort more practical: make it sort strings of a maximum length of 15. Have the array be an array of Node<string>* (that helps a lot with memory issues). The sort uses the concept of “bins”, linked lists, that temporarily hold values (i.e. move the pointers around not the actual values). Have 38 bins: first one for space, next 10 for digits ‘0’ to ‘9’, the alphabetic characters (upper and lower case), and the 38th bin for special characters. Note: make the bins of type Node<string>* and the array also of Node<string>* Randomly generate 10,000 strings with lengths from 1 to 15 (during the sort and with strings less than 15, treat all positions that are not there as space). When generating random characters, have only 10% be digits, 10% special characters, and the rest, 80%, alphabetic characters, upper and lowercase. When figuring out which bin to put alphabetic characters, temporarily convert alphabetic to upper case (or lower, just be consistent). Before the sort, print out the first 10 strings, print out the middle 10 strings, and print last 10 strings. Then do the radix sort then print out the first 10 strings, print out the middle 10 strings, and print last 10 strings. For 15 pts extra credit, implement the QuickSort using the randomly generated strings (QuickSort does not have the memory issues of Radix so regular string arrays are fine). Print the first, middle and last 10 strings before AND after the sort