Engineering
Data structures and the algorithms that operate on them, each with a theory page and a hands-on visualiser.
Sorting
Bubble Sort
Repeatedly swap adjacent pairs to float the largest value to the end.
Merge Sort
Split to single elements, then merge sorted runs in linear passes.
Insertion Sort
Grow a sorted prefix one element at a time.
Quick Sort
Partition around a pivot and recurse on both sides.
Selection Sort
Repeatedly select the smallest remaining value.
Heap Sort
Build a max-heap, then repeatedly move the root to the end.
Searching
Storage and indexing
Array
Contiguous storage with constant-time index access.
Linked Lists
Pointer-chained nodes with O(1) splicing and O(n) search.
Queues
First in, first out, and the ring buffer that makes it O(1).
Stacks
Last in, first out, and the discipline behind recursion.
Hash Tables
Map a key to a bucket so lookup stops being a search.
Trie
A tree of prefixes with lookup cost independent of set size.
Segment Trees
Disjoint partial aggregates for logarithmic range queries.
Fenwick Trees
Overlapping lowbit blocks for point update and prefix sum.
Disjoint Set
Union by rank and path compression, effectively constant time.
Suffix Arrays
Sorted suffixes, built by doubling, for substring queries.