| Program name | Files to turn in | Makefile rules | External functions | Result |
|---|---|---|---|---|
| push_swap (checker) | Makefile, *.h, *.c (*.h, *.c) | NAME, all, clean, fclean, re (bonus) | read, write, malloc, free, exit, libft | 86/80% |
The learning objectives of this project are rigor, use of C, and use of basic algorithms. Especially focusing on their complexity.
Sorting values is simple. To sort them the fastest way possible is less simple. Especially because from one integers configuration to another, the most efficient sorting solution can differ.
make
./push_swap number ...or
make
ARG=$(seq start_number final_number | shuf) ./push_swap $ARG