This project was implemented to test the different applications of sorting algorithms. The abstract below defines the origins of algorithm, why they are important and how they are used in the world of technology today. A survey was taken of five (5) sorting algorithms of varying applications and speeds. Further analysis of two (2) algorithms was conducted to show the key differences in any algorithm when its design and Big O notation are taken into consideration.
This paper was conceived and written within 30 days. It was 100% hard-coded as script text in Latex Studio with analysis of two algorithm methods implemented in Matlab. Sources and Matlab code are found in appendices of Latex Document. View a preview of the paper below or view complete final draft here.
The full analysis paper with Matlab Code can be seen here.