Back
Sorting comparison is a Data Structures Analysis final project. We made this project in order to know what algorithm is the fastest. The sorting algorithms in this context are: Selection Sort, Insertion Sort, Shell Sort, Quick Sort, Heap Sort, Merge Sort. The result is very interesting as Shell Sort, Heap Sort, and Merge Sort are the quickest among them.
Here’s some details about this project:
Name : Sorting Comparison
Course: Data Structures Analysis
Member: Kendrick Kesley & Deblin Tanudjaja
Screenshots
Leave a Reply