Writing
Notes on building things and figuring them out.
Animated Beam
A look at building animated connection lines.
BlurReveal
Building a small text reveal interaction in Vue.
Topological Sorting
Notes on graphs, dependencies, and ordering.
Dijkstra's shortest-path algorithm in C
Relax weighted edges from the closest unvisited vertex and build shortest paths from one source across a graph.
Counting sort in C and the range constraint
Replace comparisons with frequency counts and see when a narrow value range makes linear-time sorting possible.
Heap sort in C with in-place extraction
Turn an array into a max heap, extract each largest value, and retain O(n log n) performance without auxiliary storage.
Minimum spanning trees with Prim's algorithm
Connect every vertex at the lowest total edge cost and implement the greedy selection process in C.
Radix sort in C, digit by digit
Sort integers without direct comparison by applying a stable counting pass to each digit position.
Page 1 of 4