Development repo for 42cursus' push_swap project
For further information about 42cursus and its projects, please refer to 42cursus repo.

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 one (of many) most appropriate solution for an optimized data sorting.

For detailed information, refer to the subject of this project.

🚀 TLDR: this project consists of coding a program that finds the lowest possible number of moves to
sort a random list of integers using 2 stacks and a limited set of operations

@root

• 📁 includes: contains the program's headers.
• 📁 libft: contains the source code of the libft library, which is used in the program.
• 📁 srcs: contains the source code of the program.
• Makefile - contains instructions for compiling the program and testing it.

Note: only mandatory requirements of the project's subject are covered.

The program is written in C language for Linux distributions and thus needs the clang compiler and some standard C libraries to run.

1. Compiling the program

To compile the program, run:

$ make

2. Executing the program

To execute the program, run:

$ ./push_swap $ARG

where $ARG is a space separated list of integers, e.g. ARG="1 5 2 4 3"

(to be written)

• [Medium] Push_Swap: The least amount of moves with two stacks

PUSH

Take the first element at the top of one stack and put it at the top of the other; do nothing if the origin stack is empty.

• pa - top element of stack b goes to top of stack a.
• pb - top element of stack a goes to top of stack b.

SWAP

Swap the first 2 elements at the top of the stack; do nothing if there is only one or no elements.

• sa - swap stack a.
• sb - swap stack b.
• ss - sa and sb at the same time.

ROTATE

Shift up all elements of the stack by one; the first element becomes the last.

• ra - rotate stack a.
• rb - rotate stack b.
• rr - ra and rb at the same time.

REVERSE ROTATE

Shift down all elements of the stack by one; the last element becomes the first.

• rra - reverse rotate stack a.
• rrb - reverse rotate stack b.
• rrr - rra and rrb at the same time.