turk-algorithm

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.

Sorting integers using two stacks and a limited instruction set, implemented in C with the Turk algorithm for optimal move efficiency.

Push_Swap implementation by evaristoc featuring the "dipole" algo - a smart hybrid algo combining elements of the chunk - and the dual-entry circular insertion sort - for large stacks (100/500); also here, a recursive strategy for 5 elements.

O Push_swap é um projeto da Escola 42 desenvolvido em C para ordenação eficiente de dados usando duas pilhas (A e B) e instruções restritas. Implementa uma variante otimizada do Turk Algorithm (algoritmo guloso de menor custo) para calcular as rotações ideais e ordenar pilhas numéricas com o mínimo de operações possível.

Optimized stack-sorting algorithm in C. Minimizing instruction count using a limited operational set and greedy cost-calculation logic.

Sorting integers with two stacks using a Turk-style algorithm and sliding window optimization.

Highly structured algorithmic challenge - to effectively sort a set of integer values in 2 stacks of linked lists with a limited set of instructions to manipulate both stacks