The goal of the Push Swap project is to sort a list of integers using two stacks and a limited set of operations. The challenge is to achieve the sorting with the minimum number of moves.
Sorting.500.numbers.in.4992.moves.mov
- Sort 100 numbers in less than 700 moves
- Sort 500 numbers in less than 5500 moves
-
Clone the repository:
git clone https://github.com/Maroua-netizen/push_swap.git cd push_swap -
Compile the program:
make
-
Run the program:
./push_swap <list_of_integers>
./push_swap 3 2 5 1 4The following operations are used to sort the numbers:
sa : swap the first two elements at the top of stack a
sb : swap the first two elements at the top of stack b
pa : push the top element of stack b onto stack a
pb : push the top element of stack a onto stack b
ra : rotate stack a (shift all elements up by one, the first element becomes the last one)
rb : rotate stack b
rra : reverse rotate stack a (shift all elements down by one, the last element becomes the first one)
rrb : reverse rotate stack b
This project is licensed under the MIT License - see the LICENSE file for details.