Benchmarking Sorting Algorithms

[Project assessment for Computational Thinking with Algorithms GMIT 2021]

The repository contains an application which is used to benchmark five different sorting algorithms.

Submitted by: Olga Rozhdestvina (Student No: G00387844)

Lecturer: Dominic Carr

Programming Languages used: Python

---

The sorting algorithms are chosen according to the following criteria:

1. A simple comparison-based sort (Insertion Sort)
2. An efficient comparison-based sort (Quicksort and Heap Sort)
3. A non-comparison sort (Bucket Sort)
4. A hybrid sort (IntroSort)

An introduction to the above algorithms as well as an analysis of their implementation and benchmarking are concluded in a report.

---

Set up

Applications used for completion of the tasks are

• Visual Studio Code
• cmder

Distribution of Python is Anaconda Python distribution.

Packages and modules used to complete the project:

• time
• random
• pandas
• matplotlib
• os

---

License

This project is licensed under the MIT License - see the LICENSE.md file for details

---

Acknowledgment

• GMIT Lecturer Dominic Carr
• Stack Overflow
• GeeksforGeeks
• Real Python