A catalogue of 198 algorithm and data structure implementations, organised by pattern. It has two halves, kept apart on purpose.
patterns/ — 141 extracts from earlier work. Code I
wrote during the double degree in Computer Science and Business Administration at the
University of Granada, and in my own projects since, reorganised by pattern rather than by
subject. Nothing here was written for this repository: each file is the original
implementation, sliced out of the repository it belongs to, with a header naming the source
file and line range and a link to it. Every claim is checkable against the commit history
that produced it.
reference/ — 57 implementations written for this
repository. Canonical algorithms that my coursework never produced a committed
implementation of, covering the standard interview taxonomy and the computer architecture
mechanisms I studied without writing code for. These have no prior commit history and their
headers say so. Each one is self-contained and asserts its own behaviour, so it is verified
by compiling and running it.
The CI compiles and runs the 57 reference implementations on every push. They print nothing and assert their own behaviour, so a silent run is a pass and a broken invariant aborts the build:
bash scripts/verify.shok reference/01-arrays-and-hashing/in-place-matrix-transforms/in_place_matrix_transforms.cpp
...
57 reference implementations compile and verify themselves
The files under patterns/ are not compiled: they are fragments of larger programs, kept
with a link to the commit they came from, and they do not stand alone. What can be checked
about them is their provenance, and every header carries it.
Total: 198 implementations — 141 extracted, 57 written here.
Problems solved on NeetCode are tracked separately, in neetcode-submissions: 5 at the last count.
Run python3 scripts/count.py to regenerate these tables from the directory tree.
- Under
patterns/, the code is copied, not rewritten. Extracts are verbatim. The only removals are file-level includes and surrounding context belonging to the original build. They are not standalone builds; each names its origin so it can be read in context. - Only my own code is extracted. Where a subject supplied a framework — the Parchis engine, the simulation engine, the metaheuristics base classes — that framework is referenced and never copied. What is catalogued is the part I wrote.
- Under
reference/, the code was written here and says so. No provenance link is claimed for it, because there is none. Every file compiles withg++ -std=c++20and exits zero, which is what its assertions check. - Applied work is labelled as applied. The machine learning folders call scikit-learn and Keras; what is catalogued is the pipeline, the parameter search and the evaluation logic, and each folder says so.
CATALOG.md lists every entry in one table, with its language and its origin.
Or browse by category.
Extracted from earlier work:
- Graph and state-space search — 13
- Adversarial search — 15
- Metaheuristics and continuous optimisation — 22
- Concurrency and distributed systems — 19
- Data structures and abstract data types — 23
- Applied machine learning — 5
- Databases and transactions — 11
- Application architecture — 18
Written for this repository:
- Arrays and hashing — 5
- Two pointers and sliding window — 5
- Stacks and monotonic structures — 1
- Binary search — 1
- Linked lists — 2
- Trees and tries — 6
- Heaps and priority queues — 2
- Backtracking — 1
- Graphs — 7
- Advanced graphs — 7
- Dynamic programming — 3
- Greedy algorithms and intervals — 2
- String algorithms — 2
- Mathematics and bit manipulation — 2
- Computer architecture — 9
- Systems primitives — 2
Every extract under patterns/ comes from one of these.
| Repository | Content |
|---|---|
parchis-ai |
Adversarial search agent for Parchis, a four-player board game with dice. Artificial Intelligence, 3rd year. |
rescue-agents |
Reactive and deliberative agents planning over a partially known map. Artificial Intelligence, 3rd year. |
metaheuristics |
Sixteen metaheuristics applied to a portfolio allocation problem. Metaheuristics, 4th year. |
concurrency-mpi |
Classic synchronisation problems with semaphores, monitors and MPI. Concurrent and Distributed Systems, 2nd year. |
image-adt |
Image abstract data type with manual memory management. Data Structures, 2nd year. |
airline-routes-adt |
Air route system with custom containers and iterators. Data Structures, 2nd year. |
machine-learning-practices |
Supervised learning, clustering and neural networks. Machine Learning, 4th year. |
oracle-dbms-project |
Relational schema, triggers, procedures and transactional write paths. Database Design, 3rd year. |
personal-finance-manager |
Self-hosted finance service: broker statement parsing, money arithmetic, background jobs. Personal project. |
media-manager |
Photo transfer and deduplication by content hash. Personal project. |
md2html-testGenerator |
Markdown to interactive HTML converter. Personal project. |
pdf-to-md |
PDF to Markdown converter with layered extraction fallbacks. Personal project. |
econometric-model |
Linear regression with assumption diagnostics. Econometrics coursework. |
algorithm-design-techniques |
Divide and conquer, greedy, backtracking with branch and bound, and dynamic programming. Algorithmics, 2nd year. Team of five. |
neetcode-submissions— solutions to NeetCode problems, synchronised from the platform.3-Partition-NP-Completeness— write-up of the reduction proving 3-Partition is NP-complete. Proof only, no implementation, which is why it has no folder here.
MIT. See LICENSE.
Where a source repository was joint coursework, the extracts here are limited to the parts I wrote. Co-authors are credited in the source repositories.
Ismael Sallami Moreno