This is a tool for benchmarking the performance of different sorting algorithms. It is written in C and provides a command-line interface for specifying the input size and the algorithms to be compared. It was made for a university project.
Below is how you can use benchsort. Feel free to fork or copy them, but be aware of the limitations that this repository license implies.
You can use the following options to use benchsort:
To run benchsort, you must clone this repository with the following command:
git clone https://github.com/olooeez/benchsort.git
After cloning, you must enter the local repository using the following command:
cd benchsort
Install GNU Make on your system and run it with the command bellow:
make
Finally use the command below to run the project:
./bin/benchsort
To run the program in a docker container, clone the repository to your machine first:
git clone https://github.com/olooeez/benchsort.git
After cloning, you must enter the local repository using the following command:
cd benchsort
Then, use the command below to build the Docker image:
docker build -t olooeez/benchsort:latest .
Then, to run the image in a container, use the following command:
docker run -it --rm olooeez/benchsort:latest
If you would like to contribute to this project, please feel free to open a pull request. All contributions are welcome!
This project is licensed under the MIT License. See the LICENSE file for details.