How burnoz/estructuras-de-datos-y-algoritmos-fundamentales works
Project type and purpose
• This is a C++ “algorithm playground” or educational codebase. It contains standalone console programs (.cpp → .exe) that implement core algorithms and data structures for classroom activities and assignments.
• There is no central frontend/backend or database; instead, the repo is organized as a collection of independent modules, each demonstrating a particular algorithm or data structure.
File structure
• Top-level folders correspond to broad algorithm categories:
• “algoritmos” (miscellaneous algorithms)
• “arboles” (trees: avl, bst, heap, splay)
• “busqueda” (search)
• “factorial (tail recursion)”
• “fibonacci” and “fibonacci v2”
• “grafos” (graph algorithms and traversals)
• “hashing” (linear, quadratic)
• “listas enlazadas” (single, doubly)
• “ordenamiento” (sorting)
• “pilas y filas” (stacks & queues)
• “potencias” (power)
• “punteros” (pointers)
• “sumas” (sums)
• “test” (unit or smoke tests)
• Each module folder contains a C++ source file (.cpp), a compiled executable (.exe), and sometimes data/text inputs.
README
• Very brief: “Actividades en clase y tareas.”
• Confirms this is a teaching/learning repository rather than a production service or library.