Push_Swap is a project from the 42 programming school that involves sorting a stack of integers with the least number of operations. The challenge is to implement a sorting algorithm that efficiently manages the stack using a set of allowed operations. The project tests your understanding of algorithm complexity, sorting algorithms, and data structures.

• Implements various sorting algorithms designed specifically for stack data structures.
• Provides a visual and/or textual output of the steps taken during the sorting process.
• Handles small to large sets of numbers with a focus on efficiency.

To run the Push_Swap program, use the following command:

./push_swap <list_of_integers>

For example:

./push_swap 3 2 5 1 4

Special thanks to Thuggonaut, not only her tutorial on push_swap is simply amazing, I've learnt a lot about how to organise projects and make great Makefile files. <3

And, of course, to my dear, dear, Lusvart, working together from day one, we did it!!