Because Swap_push isn’t as natural
About · Usage · Usefull Command · References
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.
This project will make you sort data on a stack, with a limited set of instructions, using the lowest possible number of actions. To succeed you’ll have to manipulate various types of algorithms and choose the most appropriate solution (out of many) for an optimized data sorting..
- Rigor
- Unix
- Algorithms & AI
- Imperative programming
Follow the steps below
1. Clone the repository from github
git clone https://github.com/abdulazizabduvakhobov/push_swap.git && cd push_swap/
2. Compile the library by Makefile To compile the library, go to its path and run:
For all mandatory and bonus functions:
make
3. On the same directory run the following command:
./push_swap "<random numbers>"
Example of usage
The library is written in C language and needs the gcc
compiler and some standard C libraries to run.
1. Cleaning all binary (.o) files
To clean all files generated binary files while doing a make, go to the path and run:
make clean
2. Cleaning all binary (.o) and executable files (.a)
To clean all files generated while doing a make, go to the path and run:
make fclean
3. Cleaning all binary (.o) and executable files (.a) in all directories
To clean all files generated while doing a make, go to the path and run:
make ffclean
4. Checking Norminette standart
To check Norminette errors of all files, simply go to the path and run:
make norm
5. Running tester
To run the tester simply clone tester repository to the same folder below and run:
make test
6. Visualizing algorithm
To visualize the sorting algorithm, simply clone visualizing repository to the same folder below and run:
make vis
7. Help command
To get information about command, run:
make help