robot-piglet b48cb40b16 Intermediate changes | 4 months ago | |
---|---|---|
.. | ||
ut | b48cb40b16 Intermediate changes | 4 months ago |
README.md | 4f292c7e2f Restoring authorship annotation for <cerevra@yandex-team.ru>. Commit 2 of 2. | 2 years ago |
diff.cpp | 37de222add Restoring authorship annotation for <antonovvk@yandex-team.ru>. Commit 2 of 2. | 2 years ago |
diff.h | 37de222add Restoring authorship annotation for <antonovvk@yandex-team.ru>. Commit 2 of 2. | 2 years ago |
diff_ut.cpp | 37de222add Restoring authorship annotation for <antonovvk@yandex-team.ru>. Commit 2 of 2. | 2 years ago |
ya.make | b48cb40b16 Intermediate changes | 4 months ago |
Note: underlying algorithm library/cpp/lcs
has complexity of O(r log n) by time and O(r) of additional memory, where r is the number of pairs (i, j) for which S1[i] = S2[j]. When comparing file with itself (or with little modifications) it becomes quadratic on the number of occurences of the most frequent line.