Push-swap is a sorting algorithm using two-stack system operations. It takes a random or an user-created list of integers, which we call stack A (the left side of the bar visualization). Stack B (the right side) is considered to be empty. The legal operations for sorting the integers are as follows:

1) Push the top member of stack A to the top of stack B (or vice versa)

2) Swap the two top members of one or both stacks, or

3) Rotate one or both stacks clockwise, or counter-clockwise.

The output of push-swap is the shortest list of these commands that will sort stack A and leave stack B empty. The project repository also includes a testing program for verifying solved stacks as well as a visualizer for deeper understanding of the logic behind the algorithm. In the visualization the integers are expressed as horizontal bars with lengths correlating the final position of an individual member in the sorted solution. It also works as a pretty cool screensaver.

Written in Core C.
Public repository of the project can be found here.