Routing Back to C [Part 3]: A Hash Table That Can Grow
Part 3 of Routing Back to C. A hash table in plain C with chaining, buckets, djb2, collisions, a working resize, and valgrind at the end to prove nothing leaks.
Part 3 of Routing Back to C. A hash table in plain C with chaining, buckets, djb2, collisions, a working resize, and valgrind at the end to prove nothing leaks.
Part 2 of Routing Back to C. A singly-linked list in plain C, with diagrams for every malloc, every pointer move, and every free.
LLMs killed the cost of typing code. The bottleneck is now judgment, and judgment needs to know what's underneath. Part 1 of a six-part series where I rebuild the things every language hides from you, in C.
FEN (Forsyth-Edwards Notation) describes any chess position as a single line of text. Here's how it works, field by field, with ASCII boards and worked examples.