What's up, swappers
-
Updated
Mar 9, 2022 - C
What's up, swappers
Creating an algorithm to sort integers using 2 stacks
Project made for 42madrid
PushSwap is a 42 curriculum project all about creating your own sorting algorithm, you simply have 2 stacks and some limited methods you can use to sort your stacks with the least amount of moves possible, it may seem easy when you read that but in reality it isn't as easy as it may seem at the first glance!
Sorting a stack of numbers using the least possible amount of moves.
42 Algorithm Project - Sort problem
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.
This project involves sorting data on a stack Sorted with a derived version of the sandwich theorem and with doubly circular linked ist
I made this project in ecole 42. This project is about shorting algorithm using two stack.
Because Swap_push isn’t as natural
sorting numbers with two stacks using least amount of instructions possible
Sort random numbers from lowest to highest in the smallest number of moves.
Es un proyecto de algoritmo simple de 42.
📚 sorting algorithm program using two stacks and a limited set of instructions.
This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves.
A sorting algorithm that sorts stacks by ascending order
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.
Add a description, image, and links to the pushswap-42 topic page so that developers can more easily learn about it.
To associate your repository with the pushswap-42 topic, visit your repo's landing page and select "manage topics."