Publications and Research

Document Type


Publication Date



Our names are Edgar Aponte and Jacob Gomez and we are Applied Mathematics students at City Tech. Our mentor is Prof. Isaacson and we conducted an analysis of comparison-based sorting algorithms, meaning that they can sort items of any type for which a “less-than” relation is defined. We implemented 24 comparison-based sorting algorithms and elaborated on 6 for our poster. We analyzed the running times of these sorting algorithms with various sets of unsorted data and found that introspective sort and timsort were the fastest and most efficient, with introspective sort being the very fastest.


This poster was presented at the 35th Semi-Annual Dr. Janet Liou-Mark Honors & Undergraduate Research Poster Presentation, Dec. 2, 2021. 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.