3 ms·
It might be complicated, but as far as I’ve seen, not in a mathematical sense. Perhaps you have some examples?
by Grustaf 6y ago
It might be complicated, but as far as I’ve seen, not in a mathematical sense. Perhaps you have some examples?
- atq2119 6y agoThe tight performance bounds for Union-Find data structures are ridiculously complicated to prove given how simple the algorithm is, even in a mathematical sense. There isn't a lot of theory-building in algorithms, compared to the more traditional fields of maths, but the combinatorics are formidable.