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

Tree diff varies between O(N^2) and O(N^4) for simple solutions of varying complexity of matches possible, with a complex fully general algorithms coming in at O(N^2 log^2 N).

Tree diff is harder because the range of operations is bigger.

React.js cheats by insisting on keys for arrays so matching is much easier.



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

Search: