**1)** Implement three (3) sort algorithms (to sort integers): **selection sort, merge sort 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.
Please notice that must submit the following to the course account:
**i)** All source code must be worked on **UNIX EMACS** and with **C++ only**.
**ii)** The results of all 3 sort algorithms from step 2 above. This is to be typed up and submitted electronically with everything else mentioned.
**iii)** Test code that proves you are using the different sort algorithms appropriately per your documented results.
**iv)** If possible please briefly describe the function names and key variable names and how they fit into the algorithm is needed with a text file.
**v)** A COMPILE file so that we can compile your code and run it.
**p.s. since I am only a beginner on C++ (this is only my second class on programming, write the code as simple as you could.**
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done
**in 5 days**.
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).
I use xwin32(xterm) for compiling file. Again, the codes must be worked on UNIX EMACS.