A simple Push_swap tester for testing memory leaks/errors and error handling for the 42 school project pushswap

42 school project pushswap using radix sort

This project is about sorting data in a stack with as less actions as possible using a restricted set of operations

42 School Push_Swap - Algorithmic project on C

Algorithm sorting project

A sorting algorithm that sorts stacks by ascending order

Sort a stack with another one

This project challenges you to efficiently sort data on a stack using a limited set of instructions and minimizing the number of moves. Explore and implement various sorting algorithms to find the best solutions for optimized data sorting.

PushSwap is a 42 curriculum project all about creating your own sorting algorithm, you simply have 2 stacks and some limited methods you can use to sort your stacks with the least amount of moves possible, it may seem easy when you read that but in reality it isn't as easy as it may seem at the first glance!

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.

🔢 Sorting of data on a stack 📚 with the right algorithm for the dataset and with limited moves. [42 PROJECT]

A 42 cursus's project in which you have to sort a pile of data in ascending order

Implementation of an algorithm for sorting numbers within a fixed set of rules. Enhancing the "Turk Algorithm".

push_swap project from the 42 main curriculum

Push Swap is a 42 school project where you optimize the sorting of a stack using limited operations. This project sharpens your algorithm skills and requires efficient use of two stacks to minimize the number of moves.

Sorting algorithm project for Ecole 42

Push_swap (42 Cursus) consists of sorting data on a stack, with a limited set of instructions, in the smallest number of moves.

Because _`swap_push`_ isn’t as natural

This project involves sorting data on a stack using a limited set of instructions, aiming for the lowest possible number of actions. The goal is to write a program in C called push_swap, which calculates and displays the smallest program, made of Push swap language instructions, that sorts the integers received as arguments.

🔀 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.