push_swap: "turk algorithm" An algorithmic C project focused on sorting data with a limited set of instructions. The goal is to sort a stack of integers using only two stacks ('A' and 'B') and a specific set of rotation, swap, and push operations, aiming for the lowest possible number of moves.
Implementation of an algorithm for sorting numbers within a fixed set of rules. Enhancing the "Turk Algorithm".
42 Core Curriculum --- Stack sorting algorithm using limited operations in C. The used algorithm, "Turksort", can be found in the linked video.
My push_swap project for the 42 Cursus. An integer sorting program, using a limited set of instructions. 84/100
📶 Push-swap 2 stacks sorting
push_swap is a sorting algorithm project from the 42/1337 curriculum, focused on sorting a stack of integers using a limited set of operations with the goal of minimizing the number of moves.
push_swap will sort random integers on a stack, with a limited set of instructions, trying to use the least stack operations to get a sorted stack.
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 stack-based sorting program in C that uses optimized quick sort and stack partitioning to efficiently sort integers with minimal operations. Developed for the 42 curriculum to strengthen skills in algorithms and data structures.
42_push_swap; a game to introduce algorithm design
A length-22 permutation that three stacks in series cannot sort, with a machine-checkable DRAT certificate. Superseded by Pantone-Vatter (2026).
To associate your repository with the stack-sorting topic, visit your repo's landing page and select "manage topics."