The sharing of this project on my GitHub aims to help peoples to open their minds to new logics or help peoples in case of difficulty. In no way, that aims to copy and paste this work on your own repository.
push_swap is a project from the 42 Common Core, The project aims to create your first sort algorithm using a limited number of operation. The goal of this project isn't to creat the fastest algorithm but to creat a algorithm using less operations as possible
$> make
$> ARG="<numbers>"; ./push_swap $ARG | ./checker $ARG
Create your own checker who takes in stdin your operations that apply them to your stack. Then print "OK" or "KO" is your stack is sorted. It must respect the same rule that the reel tester gave in the subject