This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, we chose bubble sort and radix sort.
Using push_swap_visualizer we can visually see how the sorting works! 😄
- First thing you need to do is clone this repository:
git clone https://github.com/pair-programming-gabi-krebs/Push_swap.git
- After that, you shall enter the Push_swap directory:
cd Push_swap
- Compile the program and generate a binary called push_swap
make
- After that you can choose your sequence of numbers or you can let this command choose some random numbers for you:
ARG=$(seq 1 5 | shuf); ./push_swap $ARG && echo $ARG
that's it 😄
The collab:
 Gabi Sertori |
 Lucas Krebs |