PushSwap is a project that consists of sorting a stack of integers using two stacks and a limited set of operations.
-
Updated
Feb 22, 2024 - C
PushSwap is a project that consists of sorting a stack of integers using two stacks and a limited set of operations.
42 push_swap project
Custom divide & conquer sorting algorithm using 2 stacks. 6th project in the 42 Common Core Curriculum
push_swap, Codam 2020: write a program that sorts the integers received as arguments.
42 School Push_Swap - Algorithmic project on C
This repository contains the implementation of the Push Swap algorithm.
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.
Sort a list of random integers on two stacks in the least amount of moves possible using only limited operators
42 school project pushswap using radix sort
Sort random numbers from lowest to highest in the smallest number of moves.
Add a description, image, and links to the 42-push-swap topic page so that developers can more easily learn about it.
To associate your repository with the 42-push-swap topic, visit your repo's landing page and select "manage topics."