This project has been created as part of the 42 curriculum by vpogorel.
In this project I used the algo "Turcsort" to sort the stack a. It picks the cheapest number in terms of operations and moves them to stacks b until there are only 3 numbers in stack a. Then it will the 3 numbers from stack a and move the numbers from stack b to a. Eventually it will move the min of stack a to the top of stack a. The algo has a runtime of o(n^2)...
To compile the project, run the following command in the terminal:
To run the program, use the following command:
Replace [numbers] with the list of integers you want to sort. For example:
...