Push Swap is an algorithms project I completed at 42 Silicon Valley.

The idea of the project is that you have two stacks which are called Stack A and Stack B. Stack A can contain 1000+ random numbers. You have to sort Stack A from smallest to largest using only a handful of allowed moves.

I used a optomized version of Insertion Sort in order to get the stack sorted.

If you're interested in seeing my logic step by step, then you can click here to see my Medium article that goes into every detail on how this project works.