I love this algorithm -- it's so elegant and succinct. Slightly off-topic, but one of the algorithms I'm most proud of coming up with as an engineer was an off

I love this algorithm -- it's so elegant and succinct. Slightly off-topic, but one of the algorithms I'm most proud of coming up with as an engineer was an offshoot of Levenshtein distance where I had to find all pairs of strings in a set of ~1m strings which were fairly similar. 1m x 1m x O(n^2) is very slow. There turned out be a good way to figure out a lower bound on distances using some precomputation, and that eliminated almost all of the pairwise O(n^2) Levenshtein computations. I'm anyone's interested, here the description: https://www.quora.com/What-is-the-best-programming-algorithm-that-you-have-ever-created/answer/Leo-Polovets https://www.quora.com/What-is-the-best-programming-algorithm...