|
| From: | Paul Eggert |
| Subject: | Re: [bug-diffutils] time complexity of diff3 |
| Date: | Mon, 28 May 2012 19:24:07 -0700 |
| User-agent: | Mozilla/5.0 (X11; Linux i686; rv:12.0) Gecko/20120430 Thunderbird/12.0.1 |
On 05/28/2012 09:42 AM, Tim Roes wrote: > The algorithm as it is described in [1] seems to have O(n^3). I don't see why. I'd guess diff3 is O(n**2) but have not done an analysis.
| [Prev in Thread] | Current Thread | [Next in Thread] |