Push Swap
Sorts data on a stack, with a limited set of instructions and limited number of moves. In C.
About
completed
Year2018
Context42 Paris School
A sorting algorithm challenge. You are given two stacks and a limited set of instructions (swap, rotate, push). The goal is to sort a random list of integers using the fewest number of operations. It requires designing and implementing efficient sorting algorithms (like QuickSort or Radix Sort) adapted for a stack-based environment.