I have an n^3 operation that's currently a huge bottleneck at only 10k elements.... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

vlovich123 on June 6, 2025 | parent | context | favorite | on: How we decreased GitLab repo backup times from 48 ...

I have an n^3 operation that's currently a huge bottleneck at only 10k elements. Not sure how to fix it.

IshKebab on June 7, 2025 [–]

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.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact