Push swap is a project that challenges the programmer to create an algorithm that sorts a list of numbers based on a specific set of rules.
See it in action: https://www.youtube.com/watch?v=8kpR2mUiZpk

To take an argument of integers (or string and convert to int) and sort them into ascending order using only 2 stacks and a restricted set of rules for sorting. Extra points are awarded for sorting with lower moves. There are two programs running simultaneously. Push_swap and Checker. Push_swap handles the algorithm and sends instructions to stdout where Checker picks up the instructions and performs those operations. Checker then returns OK or KO depending on if your list is sorted.

PA - Put A - Puts the head of stack a to the head of stack b. Costs 1 move.
PB - Put B - Puts the head of stack b to the head of stack a. Costs 1 move.

SA - Swap A - Provided there are more than one integer in stack A, swap the head and head->next value. Costs 1 move.
SB - Swap B - Same as A but for stack B.
SS - Swaps both A and B but with a single move.

RA - Rotate A - Rotates list A. The head value becomes the tail value. Costs 1 move.
RB - Rotate B - Same as A but for stack B.
RR - Rotates A and B but with a single move.

RRA - Reverse Rotate A - The tail value becomes the head value. Costs 1 move.
RRB - Same as A but for stack B.
RRR - Reverse Rotates both A and B but costs a single move.

Assuming a valid integer set or string has been passed:

1. A check against possible duplicates is performed.\
2. The median value is found.\
3. Stack A is pushed to B in two stages.
   3a. Excluding the min and max values, values lower than or equal to the median are pushed (PB) to stack B first. Others are rotated (RA).
   3b. Once the list len of A is less than the start / 2, the remaining values are pushed to stack B.\
4. The next best move is found by evaluating both stacks. If a new move costs less than the previous, that move is saved.\
5. The saved move is then executed. First doubles are performed, then the remaining moves are carried out with the singles.\
6. This process loops until Stack B is empty.\
7. The final process evaluates where the min value is. If <= midpoint, the list will use RA to complete. Else, rra.

Slightly more detailed descriptions are contained in each file above the respective function.

This was such a fun project! It was my first sorting algorith and one that I did entirely on my own. Due to the quarantine, I've been doing a lot of coding at home because the school is closed. So I didn't have any peers to provide dedicated guidance. I'm not slowing down at all. I'm using the time to continue to catch up after losing the month when my dad passed away. I'm battling back with all I have. And I'm achieving success. I'm beyond excited about this new career and I'm doing all I can to ensure my success.