4 Feb
2014
4 Feb
'14
11:09 a.m.
Hi Erik,
Erik Erlandson
*) Runs of 'equal' dominate the script in most larger-scale applications of interest. Actual insertions, deletions, etc, are relatively small.
I can't agree with that; for me, a common case is where the two inputs are entirely different.
Something of a tangent, but I'm curious how that works for you. When two strings are entirely different, the algorithm cost is O(NxM). On larger data, say a million elements, that's terabytes of working data, and tera-ops.
This is what the max-cost / max-memory / max-time is useful for. I just give up and return the "trivial" output. Regards, Phil.