This repository contains all files, scripts and documentation for a benchmarking application which finds the average time complexity of 5 sorting algorithms. (conceptual thinkning with algorithms project)
-
Write a Python application which will be used to benchmark five different sorting algorithms.
-
Write a report which introduces the algorithms you have chosen and discusses the results of the benchmarking process.
-
The five sorting algorithms must be chosen by the following criteria:
- A simple comparison-based sort (Bubble Sort, Selection Sort or Insertion Sort).
- An efficient comparison-based sort (Merge Sort, Quicksort or Heap Sort).
- A non-comparison sort (Counting Sort, Bucket Sort or Radix Sort).
- Any other sorting algorithm of your choice.
- Any other sorting algorithm of your choice.
sorting_algorithms- folder cotaining the code for each of the 5 chosen algorithms (bubble, counting, insertion, quick and selection sort).G00398279 Conceptual Thinking with Algorithms Project Report.pdf- Final project report, incudes diagrams.benchmarking.py- The main program, containing the five sorting algorithms and the benchmarking script.benchmarking_results_plot.pgn- file containing the output image of benchmarking.py.project brief.pdf- a file containing the project brief.
- Using your browser navigate to the repository: https://github.com/kmcd14/sorting_algorithms.
- Under clone, copy the repository address, as seen in the above picture, using either SSH or HTTPS
- Open your terminal and navigate to the location where you want to store the cloned directory.
- In the terminal type the command and press enter. The cloned repository is now on your machine:
$git clone git@github.com:kmcd14/sorting_algorithms.git