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.
Available for download on Wednesday, May 18, 2022