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

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.

[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 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 one (of many) most appropriate solution for an optimized data sorting.

Push Swap is an algorithmic project from the 42 São Paulo Common Core curriculum. It sorts a stack of integers using two stacks and minimal operations, with a bonus checker to validate the solution.

A sorting program that organizes a stack of integer numbers using two stacks and a set of permitted operations and using less moviments as possible.

A sorting algorithm project that uses stacks and a limited set of operations to sort integers with the fewest possible moves.

Sorting algorithm project for Ecole 42

an algorithm that sorts random numbers with a limited set of instructions

push swap aims to optimise an algorithm as much as you can, with a fixed amount of movements available to you

42 Push Swap, sort stacks of 100 and 500 numbers in the fewest moves possible with limited operations. This custom solution is faster than any I could find to compare with.

42 School Push_Swap - Algorithmic project on C

Test your Push Swap with the required Tests

Java PushSwap is a sorting algorithm implementation for arranging integers using minimal commands. This project offers a Java solution for the 42-push_swap

An algorithmic project designed to sort a stack of integers using a limited set of operations.

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 one (of many) most appropriate solution for an optimized data sorting.