Manual:WikiDiff3.php/zh

细节
新版本的差异引擎. This diff implementation is mainly lifted from the LCS algorithm of the Eclipse project which in turn is based on Myers' "An O(ND) difference algorithm and its variations" citeseer.ist.psu.edu with range compression (see Wu et al.'s "An O(NP) Sequence Comparison Algorithm".

This implementation supports an upper bound on the execution time. Complexity: $$O((M + N)D)$$ worst case time, $$O(M + N + D^2)$$ expected time, $$O(M + N)$$ space.

