Implemented Insertion Sort, Quick Sort, and Heap-Sort algorithms and computed and graphed the running times for each algorithm with various input sizes and compared them to the theoretical running times using O-notation. This project was for my Design and Analysis of Algorithms course (COT4400).
Implemented Insertion Sort, Quick Sort, and Heap-Sort algorithms and computed and graphed the running times for each algorithm with various input sizes and compared them to the theoretical running times using O-notation. This project was for my Design and Analysis of Algorithms course (COT4400).