This project is about sorting data in a stack with as less actions as possible using a restricted set of operations

42 School Push_Swap - Algorithmic project on C

This project challenges you to efficiently sort data on a stack using a limited set of instructions and minimizing the number of moves. Explore and implement various sorting algorithms to find the best solutions for optimized data sorting.

A sorting algorithm that sorts stacks by ascending order

Sorting algorithm project for Ecole 42

Push_swap (42 Cursus) consists of sorting data on a stack, with a limited set of instructions, in the smallest number of moves.

Because _`swap_push`_ isn’t as natural

This project involves sorting data on a stack using a limited set of instructions, aiming for the lowest possible number of actions. The goal is to write a program in C called push_swap, which calculates and displays the smallest program, made of Push swap language instructions, that sorts the integers received as arguments.

Implementation of an algorithm for sorting numbers within a fixed set of rules. Enhancing the "Turk Algorithm".

push_swap project from the 42 main curriculum

Push Swap is a 42 school project where you optimize the sorting of a stack using limited operations. This project sharpens your algorithm skills and requires efficient use of two stacks to minimize the number of moves.

Sorting a pile of data in ascending order

Push Swap is a sorting algorithm project in C. It involves sorting a stack of integers using a limited set of operations.

Two stacks sort with RADIX

Sorting data on a stack, with a limited set of instructions, using the lowest possible number of actions. Radix sort. - C

Algorithm sorting project

This repository contains the implementation of the Push Swap project from 42 School.

Sort a stack with another one

🔀 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 project, the goal of which is to sort the stack using a limited set of operations and as few instructions as possible.