Bash script to test the performance of your push_swap project

Implementation of push-swap (42-school project) on python with GUI.

A fast push_swap tester

A bespoke sorting algorithm, on 2 stacks.

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.

📚 Sorting algorithm using only two stacks

A simple Push_swap tester for testing memory leaks/errors and error handling for the 42 school project pushswap

A regular 42Cursus journey here!

42 project: sorting algorithm using two stacks

42 Cursus - push_swap: This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.

A tester for 42 push_swap project (more info in README.md).

sorts numbers by using push-swap instruction language

Simulator based on actors written in Elixir. Since actors in Elixir are fully asynchronous, implementation of Asynchronous Gossip and PushSum Algorithms.

My journey in school 42 Florence

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.

Because Swap_push isn’t as natural xD

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

This project involves sorting data on a stack using another stack, with a limited set of instructions, and the smallest number of moves.

A sorting algorithm that can sort any number of integers in an efficient way with minimum number of operations. It includes the bonus which implements the checker program to check the functionality of push_swap.

Sorting algorithm using two stacks