Push Swap is a C program that sorts integers using two stacks and a limited set of operations (push, swap, rotate). Designed to minimize the number of moves, it demonstrates expertise in algorithm optimization, data structure manipulation, recursion, and efficient memory management, showcasing advanced problem-solving skills.

Program to sort N numbers using only two stacks and stack's operations.

The algorithm fills free space by tetrominoes (like in Tetris) from the input file in the best possible way.