Translations:Manual:WikiDiff3.php/3/en

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.