There are 1 repository under push-swap topic.
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
Efficient, documented and Medium article attached. 3784 moves to sort 500 numbers!
A bespoke sorting algorithm, on 2 stacks.
📚 Sorting algorithm using only two stacks
push_swap is a sorting algorithm based on sorting two stacks with the least amount of moves.
A regular 42Cursus journey here!
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 tester for 42 push_swap project
A tester for 42 push_swap project (more info in README.md).
[42 Madrid] Because swap_push isn’t as natural
This tester is designed to test the push_swap project from the 42 / 1337 school. It will assess your push_swap program with various inputs and provide the result of each test along with the average of all the tests.
Working Push Swap tester
42cursus' push_swap project. Begin date 20/jan/2022. Finish date 14/feb/2021. About 89h of total work.
Push Swap & Checker with GUI / Finished / 125 scored
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 curriculum project that involves sorting a stack of numbers using a limited set of operations. The goal is to arrange the numbers in ascending order on one stack while using the other stack for temporary storage.
Sort data on a stack, with a limited set of instructions, using the lowest possible number of actions
push_swap is a classic algorithmic project. The main objective is to sort a stack of integers using a limited set of operations, implemented in C, with the goal of using the fewest possible moves.
A push swap visualizer project made in C with the MiniLibX API
Sorting algorithm using two stacks and a limited set of operations. Developed as part of the 42 school curriculum.
[42-Cursus] A sorting algorithm project where you must sort data on a stack using a limited set of instructions in the fewest moves possible.
📊 This project focuses on sorting data on a stack using a limited set of instructions, with the goal of minimizing the number of actions required 🔁.