A sorting algorithm that sorts stacks by ascending order
-
Updated
Jul 21, 2023 - C
A sorting algorithm that sorts stacks by ascending order
Algorithm sorting project
In this project, our objective was to efficiently sort data within a stack, employing a constrained set of instructions while minimizing the overall number of steps required. Our pursuit led us to explore a myriad of algorithms, culminating in the use of a personalized mix of them.
This is a tester for the 42 Push Swap project. It is designed to test the functionality and correctness of the push_swap program.
42 School Push_Swap - Algorithmic project on C
A sorting algorithm implementation in C utilizing stack operations, designed for efficiency and simplicity.
[42 SCHOOL - LEVEL 2] The least amount of moves with two stacks. This project is about an optimized data sorting.
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.
42 push_swap project
🔀 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.
Creating an algorithm to sort integers using 2 stacks
This project is about sorting data on a stack, with a limited set of instructions, using the lowest possible number of actions
libft, ft_printf, get_next_line, born2beroot, pipex, push_swap
Project made for 42madrid
This project involves sorting data on a stack Sorted with a derived version of the sandwich theorem and with doubly circular linked ist
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.
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."