This repository contains the implementation of the first sorting algorithm in the 42 curriculum.
The project involves developing an algorithm to sort two stacks, a and b, with the minimum number of movements possible.
The functions are written in C language and need the gcc compiler.
To compile the project, go to its path and run:
For mandatory :
$ make
To delete all files generated with make, go to the path and run:
$ make fclean
The bonus involves developing a checker to validate the output of the push swap program. This tool verifies that the sorting algorithm produces the correct results by ensuring that the final order of elements in the stacks meets the expected criteria.
To compile the bonus:
For bonus :
$ make bonus
This project have been tested with (https://github.com/gemartin99/Push-Swap-Tester).