42Porto_Push_swap

Push_Swap is a C project from the 42 Porto Common Core program. The main goal of this project is to organize a list of random numbers in ascending order. To achieve this, only the use of two stacks (referred to as stack_a and stack_b) and some predefined movements of elements within and between the stacks are allowed. For more detailed information, look at the subject of this project.

Getting Started

You just need to download or clone this git repository. git clone git@github.com:Uatilla/42Porto_Push_swap.git

How to use it

Run make to build all necessary files.
Then run ./push_swap <*Elements*>, you should replace Elements by any amount of integer negative or positive numbers, since they don’t repeat in the list, for example:
./push_swap 5 3 -8 1 0 7.
To delete all .o files: make clean.
To delete all .o files and library: make fclean.
To delete all .o files, library, and rebuild the Mandatory .o files: make re.

Rules

List of Movements

Below there is the list of movements allowed:

Grades

The evaluation grades are based on the number of movements needed to order the list:

Norminette:

The Norminette is a tool provided by 42 Network to check whether the source code complies with the school's norm. The rules include the prohibition of ‘for’ loops, a limit of 25 lines, and no more than 4 parameters in each function, among other specifications.

Here is a link to more details about what is evaluated by the Norminette tool.

How my project works

To set up the structure, various methods can be applied, such as using an array of integers or a singly linked list. For this project, I chose a double-linked list, as it offers the most efficient way to move values around, minimizing movements. Once the head and the tail of the list are connected, it becomes possible to 'jump' between the start and end of the list easily.

To sort the data, numerous methods can be applied, such as Radix, Insert Sort, and others. I opted for the Turkish Method due to its high efficiency, typically requiring fewer movements compared to alternative methods.

Results

The program reached the grade 100 needing 4,861 moves to sort 500 numbers (the minimum to reach grade 100 are 5,500), so 12% more efficient.

Sources

Double Linked List: Neso Academy has one of the best YouTube channels that explains C programming concepts very easily and clear, here is the link.
Turkish Method: Many thanks to A. Yigit Ogun who explained about the method, you can reach his content here.
Push Swap Overview from Jamie Dawson link.

Contributing

Contributions to the project are welcome! If you have any ideas, improvements, or bug fixes, please submit them as issues or pull requests to this repository.

Welcome to my new brave world!

00100010 01000010 01100101 00100000 01110111 01100001 01110100 01100101 01110010 00100000 01101101 01111001 00100000 01100110 01110010 01101001 01100101 01101110 01100100 00100010 00100000 01000010 01110010 01110101 01100011 01100101 00100000 01001100 01100101 01100101

About me

👋 I'm Uatilla Viana Almeida.
🌱 I'm currently studying Common Core at 42 Porto after successfully completing the Piscine.
👀 I'm interested in Bitcoin, Games and Sports of all kinds.
🚀 Additionally, I have an interest in AI, Python, Data Analysis and Project Management.
📫 You can reach me on LinkedIn.
🤔 Feeling amazing about how AI can help our society.

Uatilla/42Porto_Push_swap