2023-2024 Fall Analysis of Algorithms 1 Project 1

Introduction

This project implements a QuickSort algorithm for sorting city populations. It includes three pivoting strategies (last, random, median) and a hybrid approach that switches to insertion sort based on a defined threshold.

How to Build and Run

To build and run this project:

1. Clone the repository.
2. Navigate to the project directory.
3. Execute g++ -fdiagnostics-color=always -g QuickSort.cpp -o QuickSort
4. Run the execute with the following format: ./QuickSort <DATASET-FILE-NAME>.csv <l|r|m> <THRESHOLD VALUE> <OUTPUT-FILE-NAME>.csv [v]

GitHub Workflows

Docker Build and Run

This workflow builds a Docker image and compiles the QuickSort code whenever changes are pushed to the main branch or a pull request is made. It runs QuickSort for all populations and all pivoting strategies with threshold 1, and for all population with randomized pivot strategy for several different thresholds.

C++ Linting

This workflow performs linting on the QuickSort.cpp file using cppcheck.

Notice

This repository was made public after the submission date.