This project aims to develop the most efficient algorithm to sort a sequence of numbers in the fewest steps possible. The sorting process is optimized using stack data structures, and data is transferred between two stacks. Various sorting algorithms (Bubble Sort, Quick Sort, etc.) are evaluated to select the most suitable one. The project provides

Repositório para a Disciplina de Estrutura de Dados II

🔧 Educational C implementations of classic sorting algorithms: Bubble, Insertion, Selection, and Substitution sorts.

ALX 4th month project

my algorithms and data structures works

Métodos de ordenação, Buble-Sort, Insertion-Sort, Merge-Sort, Quick-Sort, Selection-Sort, Shell-Sort e Heap-Sort, junto com Pesquisa Sequencial e alguns exercícios.