Abstract Data Types
Packing data together with the operations on it and hiding the inside: from the concepts through to writing generic code in C.
- adt
- c
- data structures
Writing
Notes on backend architecture, deployment and the decisions behind the systems I build.
Data Structures
Efficiency and Big-O
How to predict what an algorithm will cost before running it: counting loops, finding the dominant term, and the seven efficiency classes.
- algorithms
- big-o
- data structures
Linked Lists
Implementing a linear list with pointers: inserting, deleting, searching and traversing nodes, then the circular, doubly and multi-linked variants.
- linked list
- c
- data structures
Stacks
The linear list restricted to a single end: LIFO. Eight operations, two implementations, and the four things stacks are actually for — reversing, parsing, postponement and backtracking.
- stack
- c
- data structures
Queues
The linear list open at both ends: FIFO. Four operations, the two special cases that break queue code, the circular-array trick, and what queuing theory does with all of it.
- queue
- c
- data structures