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.