An Analysis of Non-Comparison Based Sorting Algorithms

Authors

Jacob M. Gomez, CUNY New York City College of TechnologyFollow
Edgar Aponte, CUNY New York City College of TechnologyFollow
Brad Isaacson, CUNY New York City College of TechnologyFollow

Document Type

Poster

Publication Date

5-5-2022

Abstract

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.

Comments

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).