A

algorithms

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

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.

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

igraph graph algorithm library bindings for Kit

My lab assignments for IT013IU Data Structures & Algorithms course at HCMIU.

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

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

Object oriented python implementation of a user driven workout scheduler. With the use of recursive algorithms and user input, it creates optimal workouts for the user.

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

https://dsa.nopejs.me :)

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.

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.

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.