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

You can do better than O(N^2) if your changes are monotonic /independent (or you're able to cache for basically the same reason). This usually requires either luck, a huge amount of programmer discipline, or very different programming languages than we're used to like unison.


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

Search: