1. Implement three (3) sort algorithms (to sort integers): selection, merge and radix sort.
2. Test these three algorithms on lists varying from 100 items to 1,000,000 items to find out for what range of items each sort algorithm takes the least time to sort the list.
3. From the results of step 2, create an overall sort function that accepts a list of some size (given the list size) and then selects the fastest sort algorithm of the three to be used to sort the list.
This project is for C++ Data Structure, so basically I need only "C++" Code, not C. BTW, this is my first C++ class, so please use as simple code as possiable. I only learned array, linked list, and Stack/Queue so far =)
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
The program has to work 100% on "Unix". I am using XWin32 on Unix, so basically you have to type "g++" to compile all the files.