Courses

Computer engineering subjects, taught in order. Each course is a set of lessons that build on each other.

Beginner · 3 lessons · 17 min read

Algorithm Analysis Essentials

Predict how code scales before you run it: asymptotic notation, recurrences and the master theorem, and amortized analysis, with proofs you can follow and exercises with solutions.

algorithms
complexity
big-o
recurrences
amortized-analysis

Foundations
01Growth Rates and Big O6 min read
02Recurrences and the Master Theorem6 min read
Going further
03Amortized Analysis5 min read

Intermediate · 2 lessons · 17 min read

Data Structures in C

Build the structures every program leans on, from scratch, in plain C11: a growable array and an open addressing hash table, with careful memory handling and measured cost analysis.

c
data-structures
memory
hash-tables
dynamic-arrays

Linear structures
01Dynamic Arrays7 min read
Associative structures
02Hash Tables with Open Addressing10 min read