Push Swap 📊

Push Swap is a sorting algorithm challenge where you must sort a stack of integers using a limited set of stack manipulation instructions with minimal operations.

• Two stacks: a and b
• Goal: Sort stack a in ascending order
• Allowed operations:
  • sa: Swap top two elements of stack a
  • sb: Swap top two elements of stack b
  • ss: Swap top elements of both stacks
  • pa: Push top element from b to a
  • pb: Push top element from a to b
  • ra: Rotate stack a up
  • rb: Rotate stack b up
  • rr: Rotate both stacks up
  • rra: Reverse rotate stack a
  • rrb: Reverse rotate stack b
  • rrr: Reverse rotate both stacks

make           # Compile push_swap
make bonus     # Compile checker (optional)

# Sort integers
./push_swap 3 2 1 0 5

# Check sorting with checker
./push_swap 3 2 1 0 5 | ./checker 3 2 1 0 5

• 100 numbers: < 700 operations
• 500 numbers: < 5500 operations

• C programming language
• No global variables
• Minimal number of sorting operations
• Error handling for invalid inputs

• Implement efficient sorting algorithm
• Minimize number of stack operations
• Handle edge cases and input validation

• Implement a checker program to validate sorting instructions

• Mohammed Amine Es-salhi