Sorting algorithm using two stacks

Sort random numbers from lowest to highest in the smallest number of moves.

libft, ft_printf, get_next_line, born2beroot, pipex, push_swap

Step by Step Prochecker for Push_Swap 42 proyect

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

42 Project about sorting algorithms. The program, called push_swap, takes a list of integers and sorts it using a set of predefined operations on two stacks. Another program, called checker, verifies the correctness of the sorting by executing the instructions generated by push_swap on the stack A.

"The Push_swap project is a very simple and highly effective algorithm project: data will need to be sorted"

A simple shell script to test the push_swap project of the 42Cursus

🔀 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 is pain incarnate, by the end of it you'll have a newfound passion for literature, cause you won't ever want to count again

complexity algorithm analysis

A program that sorts a stack of integers in the least steps possible, based on a limited set of instructions

Pushswap is a 42 project emphasizing efficient sorting by minimizing operations. Participants use a limited set of commands to manipulate stacks and achieve the desired sorted order, showcasing algorithm design and optimization skills while developing problem-solving abilities.

The seventh project of 42's curriculum asks students to find an optimized way to sort data with two stacks and a limited set of instructions.

125/100

Push Swap print some instructions to sort integers

42 Project about sorting data with two stacks efficiently