This repository contains implementations of basic sorting algorithms in Ada, as well as infrastructure used to generate random numeric data and to time the sort operations.
The user is prompted to select a sorting algorithm and output format, then they can execute a sort of a random test array.
The following sorting algorithms have been implemented:
- Bubble Sort
- Heap Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Selection Sort
A Makefile is provided to build, test and generate documentation for this project. To build the project, run the following:
> make
Unit tests are defined for each sorting algorithm. To execute unit tests, run the following:
> make test
This project is written using gnatdoc comments, so that documentation can automatically be generated. To generate documentation, run the following:
> make docs
A GitHub workflow been created to provide continuous integration for this project. The workflow will create a Ubuntu docker container with gnat dependencies installed and attempt to build the project. It will then build and execute all unit tests.
The workflow can be tested locally using act. Once act is installed, the workflow can be executed using the following command:
> act -s GITHUB_TOKEN=$(cat .token)
where .token is a private file containing the user's GitHub access token. This file provides access to the user's GitHub account and must not be shared.