Development repository for the 42cursus push_swap project @ 42 São Paulo
This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.
| Est. Time | Skills | Allowed Functions | Difficulty |
| 60 hours |
 
|
-lightgrey){kind=icon}
-lightgrey){kind=icon}
-lightgrey){kind=icon} -lightgrey){kind=icon}
-lightgrey){kind=icon}
|
1855 XP |
$ make
$ ./pushswap 3 4 5 2
$ make bonus
$ ./pushswap 3 4 5 2 | ./checker