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.
Implementation of push-swap (42-school project) on python with GUI.
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.
A simple Push_swap tester for testing memory leaks/errors and error handling for the 42 school project pushswap
Bash script to test the performance of your push_swap project
A bespoke sorting algorithm, on 2 stacks.
📚 Sorting algorithm using only two stacks
Efficient, documented and Medium article attached. 3784 moves to sort 500 numbers!
42 school project pushswap using radix sort
A regular 42Cursus journey here!
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
simple tester for push swap 42 project
Push Swap: The most efficient yet inefficient algorithm.
push_swap is a sorting algorithm based on sorting two stacks with the least amount of moves.
A tester for 42 push_swap project (more info in README.md).
Add a description, image, and links to the push-swap topic page so that developers can more easily learn about it.
To associate your repository with the push-swap topic, visit your repo's landing page and select "manage topics."