Latest / Deep End Era. Engineering with Sankalp
The Club Secretaries: Union-Find and Disjoint Sets
In Leeds, Nadia Okafor and Ben Hartley must work out which of eleven million hospital records belong to the same four million people, and Ben's relabelling job has been running all weekend. In part eleven of The Deep End's Data Structures series we meet the fifteen-line structure that fixes it in a minute: union-find. We follow it from a 1964 Fortran compiler to physicists pouring imaginary water through random rock, image segmentation and the type checkers in OCaml and Haskell, and meet the inverse Ackermann function, which is provably never constant and never more than four. Then a…
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.