The projects in this repository are carried out in the common core process of 42 schools.
-
Updated
Sep 3, 2024
The projects in this repository are carried out in the common core process of 42 schools.
Push_swap is a sorting algorithm project where the goal is to sort a stack of integers with the fewest operations, using a limited set of commands
push swap, a 42 school project about sorting numbers with 2 stacks
Push_swap tester and bonus tester + GUI pro checker
This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves.
42 libft project with helpfull function from printf, getnextline, pipex, pushswap and minishell
push_swap is a 42 school project where we must sort random numbers with a limited set of instructions, using the lowest possible number of actions.
"Algorithm that sorts data using two stacks."
42 push_swap project
A simple Push_swap tester for testing memory leaks/errors and error handling for the 42 school project pushswap
Conquer the array sorting puzzle with our project. Navigate the task using a limited set of instructions, sparking creativity in devising efficient sorting strategies for an array of integers. This endeavor offers a unique twist on traditional sorting algorithms, emphasizing concise and effective instruction sets.
🔀 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.
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.
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.
the "Push_Swap" project is a challenging exercise that involves sorting data on a stack using a limited set of instructions.
This project allows to sort data in a stack using the minimum possible number of actions
Add a description, image, and links to the pushswap-42 topic page so that developers can more easily learn about it.
To associate your repository with the pushswap-42 topic, visit your repo's landing page and select "manage topics."