This project was conducted during the 12th grade AP CSA class, with the final grade of "A".
Comparing Different Sorting Algorithms
Five of the most basic sorting algorithms introduced in an AP CSA course are selection sort, insertion sort, merge sort, quick sort, and heap sort. Since these algorithms are fairly simple to implement, it is necessary to consider the trade-offs of algorithms, that is, it is important to consider whether the algorithm allocates excessive memory or whether the algorithm takes overdone time to compile and run. In this paper, focusing on the efficiency of the algorithm, 5 different sorting algorithms were implemented and compared via runtime and number of operations. The results were then organized in each table.
View Project Paper