This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, I had to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.
Makefile a the root allowed you to compile the libft, the chercker and the push_swap.
So you can run:
make libft
make checker
make push_swap
Or simply:
make
This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.
The checker will get as an argument the stack a formatted as a list of integers.
The checker will then wait and read instructions on the standard input, each
instruction will be followed by ’\n’. Once all the instructions have been read
checker will execute them on the stack received as an argument.
It comes from tharchen's github
I did make some changes, especially the adding the min and max values
This tester shows the performance of your push_swap program.
## How do I run this tester?
```bash
bash push_swap_tester/tester.sh [path-to-push-swap-dir] [stack-size 0R range] [nb_of_tests]
the following command will perform 100 testss with a stack of 100 integers
bash push_swap_tester/tester.sh ../push_swap 100 100
the following command will perform 100 tests with a stack of 100 integers, then 100 tests with a stack of 101 integers and then 100 tests with a stack of 102 integers
bash push_swap_tester/tester.sh ../push_swap 100-102 100