Every dispatch filed under “Algorithms” · 10 entries.
Implementing breadth-first search with a stack instead of the usual queue, and what changes when you flip the underlying data structure.
Understanding BFS and DFS graph traversal, the difference between visiting and exploring a node, with implementations and examples.
A diagram-first introduction to graph theory from a computer science angle, covering what graphs are, the different kinds, and their real-world uses....
Tessellation for spatial indexing divides space into non-overlapping shapes for efficient data management. The Uber H3 grid system uses hexagonal cells, offering...
Grid systems in spatial indexing, including Geohash and Google S2, encode geographic locations for efficient spatial data management. Geohash uses a Z-order...
Spatial indexes optimize multi-dimensional data querying using space-filling curves like Z-order and Hilbert curves. Z-order curves employ a recursive Z pattern, and...
What a cartogram is and how it reshapes geography by statistical data such as population, laying the conceptual groundwork for building one....
Introducing hybrid quad-kd and r-kd tree structures that combine the quadtree, KD-tree, and R-tree to speed up search over mixed point and...
Why geometric algorithms like the convex hull break under floating point arithmetic, and the round off errors that produce non-convex or never-ending...
How external merge sort handles datasets too large for memory, using a split phase and a priority queue driven K-way merge, walked...