bug-diffutils
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[bug-diffutils] time complexity of diff3


From: Tim Roes
Subject: [bug-diffutils] time complexity of diff3
Date: Mon, 28 May 2012 18:42:31 +0200
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:8.0) Gecko/20120216 Icedove/8.0

Hi,

can anyone tell me what time complexity (linear, quadratic, cubic, ...) diff3 has?
The algorithm as it is described in [1] seems to have O(n^3).
Unfortunately I didn't found any information about that in any documentation (but might have missed it).

Thanks for your help,
Tim

[1] A formal investigation of Diff3 -- http://www.cis.upenn.edu/~bcpierce/papers/diff3-short.pdf

--
Tim Roes
Herrmann-Leichtlin-Str. 30
D-76185 Karlsruhe

www.timroes.de


Attachment: smime.p7s
Description: S/MIME Cryptographic Signature


reply via email to

[Prev in Thread] Current Thread [Next in Thread]