This project sorts integers on a stack datatype, with a limited set of instructions.
The goal of this project is to learn how to succesfully manipulate various types of searching/sorting algorithms. And to choose the most appropriate solution for your complexity needs.
109%
- Uses a variation on Radix sort for larger stacks (also uses Bubble sort as a helper function)
- Uses a custom algorithm (somewhat mix of Insertion sort and Merge sort)
- Includes a self made checker for bonus
Clone this repo
git clone https://github.com/lightiverson/push_swap.git
cd push_swap
make
Execute push swap
./push_swap 0 2 1
Execute checker
cd checker
make
../push_swap 0 2 1 | ./checker 0 2 1
A more detailed explanation of the assignment can be found in the assignment sheet.