# Manual:WikiDiff3.php

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