Publications and Research

Document Type


Publication Date



Sorting algorithms put elements of a list into an order (e.g., numerical, alphabetical). Sorting is an important problem because a nontrivial percentage of all computing resources are devoted to sorting all kinds of lists. For our project, we implemented two non-comparison based sorting algorithms from pseudocode and compared them to various comparison based sorting algorithms. The two algorithms have their advantages and disadvantages as well as their unique features. We found that Radix Sort (which is a modified version of Counting Sort) was the most efficient of them all.


This poster was presented at the 36th Semi-Annual Dr. Janet Liou-Mark Honors & Undergraduate Research Poster Presentation, May 5, 2022. Mentor: Prof. Brad Isaacson (Mathematics).



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.