Algorithm in C to sort a list of integers with the fewest possible moves.

42 school project pushswap using radix sort

A project designed to teach sorting algorithms and their complexity by implementing a stack-based sorting program in C.

Push Swap 42

📤 • Efficient stack sorting using limited operations in push_swap.

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

Sorting numbers with least amount of instructions

This project focuses on efficiently sorting a stack of unsorted integers with a restricted set of operations

This project's challenge is to 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 stacks of numbers in the most efficient way 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.

This repository contains the implementation of the Push Swap algorithm.

Because _`swap_push`_ isn’t as natural

Sorting algorithm project for Ecole 42

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