Hacker News new | ask | show | jobs
by vlovich123 377 days ago
I have an n^3 operation that's currently a huge bottleneck at only 10k elements. Not sure how to fix it.
1 comments

I once looked into tree diffing algorithms (the literature is all about diffing XML even though it's really trees). The obvious dumb algorithm (which seems to be what everyone uses) is n^4.