# 手册:WikiDiff3.php

This page is a translated version of the page Manual:WikiDiff3.php and the translation is 57% complete.
Languages:

## 细节

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.