This project will make you sort data on a stack, with a limited set of instructions, using
the lowest possible number of actions. To succeed you’ll have to manipulate various
types of algorithms and choose the one (of many) most appropriate solution for an
optimized data sorting.
The Push_swap project is a very simple and highly effective algorithm project: data will
need to be sorted. You have at your disposal a set of int values, 2 stacks and a set of
instructions to manipulate both stacks.
- Unix
- Imperative programming
- Rigor
- Algorithms & AI
🚧 project:
push_swap42 $ make
🚿 Clean Obj files:
push_swap42 $ make clean
🚿 🚿 Clean All (obj files + binary):
push_swap42 $ make fclean
🚿 🚿 🚧 Clean All + build:
push_swap42 $ make re
See Makefile
