Skip to content

Latest commit

 

History

History
69 lines (37 loc) · 1.76 KB

README.md

File metadata and controls

69 lines (37 loc) · 1.76 KB
Raw

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

Distribution of Python is Anaconda Python distribution.

Packages and modules used to complete the project:

License

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

Acknowledgment