A

algorithms

Multidimensional arrays for C++. (Not an official Boost library) GitHub mirror: https://github.com/correaa/boost-multi

Daily LeetCode practice – clean solutions, explanations, and daily updates.

Leonardus is an open source project. It is a minimalist, stack-based programming system designed as a flexible framework for implementing and exploring algorithms. The syntax and semantics of its scripting language, LeoScript, are inspired by PostScript and Forth. It is extended with a prototype-based, object-oriented paradigm, has seamless integration into JupyterLab and Docker, and provides a concise and expressive environment for learning and experimentation.

The project name is a nod to Leonardus Pisanus, who was named and became known as Fibonacci.

Consult the project's GitLab Pages for documentation.

High-performance data structures and algorithms library for Zig. Includes graphs, trees, caching, string search, and serialization (DOT/GQL).

Algorithms Exercises solved in C++17, running with CMake and Catch2 unittest framework. Developed with TDD.

[CC BY-NC-SA] A compendium of the community knowledge on game design and development

Algorithms Exercises solved in C (GNU11), running with CMake and Catch2 (C++) unittest framework. Developed with TDD.

Low-frequency Excision of the Atmosphere in Parallel (LEAP) Calibration using GPU acceleration.

Thesis titled "Analysis of the structure of k-SAT formulas and of some resolution algorithms". Bachelor's degree in Computer Science, University of Milan-Bicocca.

Framework for modeling financial systems using weighted automata, with analysis of worst-case and best-case outcomes

Standard and useful data structures and algorithms implemented in C.

Fundamental theory and practice in Data Science (DS). 🧮

Algoritmos prontos, funcionais e contruídos no VisuAlg. Conteúdo do básico até matrizes (arrays).

Projet pédagogique en algorithmie et intelligence artificielle consistant à créer un agent (Kevin) capable de résoudre un labyrinthe.

Le projet explore plusieurs approches :

Génération de labyrinthes (DFS, Prim) Algorithmes de recherche de chemin (A*, Dijkstra) Apprentissage supervisé (Imitation Learning avec CNN) Apprentissage par renforcement (Deep Q-Network)

Des outils de visualisation permettent de générer des images et des GIFs montrant Kevin se déplacer dans le labyrinthe.

Projet réalisé dans le cadre de la formation Développeur en Intelligence Artificielle (Simplon).

Transducers for working with foldable data types.

Hbox is a commandline-terminal sokoban solver written in Ada. It is "generic" in the sense that it contains no domain specific strategies. It also provides a demonstration of the advantage in using the Hungarian Algorithm, for Windows, OSX, & linux.

Featuring

* no installation * no dependencies * simply unzip in your Downloads directory, and run.

Simulation d’un jeu Tic Tac Toe sur une grille 10x10 avec une condition de victoire de 5 pions alignés.

Le projet fournit un moteur de jeu simple permettant de :

faire jouer deux agents (IA vs IA / LLM vs LLM) tester des stratégies connecter une interface CLI ou Web ultérieurement

Le moteur gère la logique complète :

validation des coups alternance des joueurs détection de victoire (horizontal, vertical, diagonales) détection de match nul stratégie de mouvement simple (fallback)

Projet pédagogique en algorithmie et intelligence artificielle.

A Common-Sense Guide to Data Structures and Algorithms code illustrations in Rust

A curated collection of C programming exercises, examples, and mini‑projects aimed at mastering the core language fundamentals. Topics include memory management, pointers, data structures, algorithms, systems programming, and problem‑solving patterns. This repository is intended as a practical learning path for developers advancing toward expert‑level C proficiency.