Push_swap
Optimised sorting algorithms in C

Algorithm project in C where an integer stack must be sorted with a very limited operation set: swap, push, rotate and reverse rotate across two stacks. The program does not sort the data directly. It has to output the best possible instruction sequence so that the checker validates the result.
The difficulty is twofold: parse arguments cleanly, handle errors and duplicates, then find an efficient strategy depending on input size. Small datasets often require hand-optimised cases, while larger lists need a more systematic approach such as radix sort, chunking or a movement-cost strategy.
Push_swap is a good exercise in balancing algorithmic cleanliness with concrete scoring. The goal is not only to be correct, but to reduce operation count, measure performance, compare strategies and keep the implementation clear enough to remain debuggable.


