42 school project pushswap using radix sort

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

This project aims to develop the most efficient algorithm to sort a sequence of numbers in the fewest steps possible. The sorting process is optimized using stack data structures, and data is transferred between two stacks. Various sorting algorithms (Bubble Sort, Quick Sort, etc.) are evaluated to select the most suitable one. The project provides

42 push_swap project

push_swap, Codam 2020: write a program that sorts the integers received as arguments.

PushSwap is a project that consists of sorting a stack of integers using two stacks and a limited set of operations.

42 School Push_Swap - Algorithmic project on C

Sort a list of random integers on two stacks in the least amount of moves possible using only limited operators

Custom divide & conquer sorting algorithm using 2 stacks. 6th project in the 42 Common Core Curriculum

Push_Swap (42courses) This project aims to sort data on a stack, with a limited set of instructions, using the lowest possible number of actions.

Sort data using two stacks, using the lowest possible number of actions.

This repository contains the implementation of the Push Swap algorithm.