Posted on Jan 27, 2010 by
Massive Kangaroo
Create a parameterized class that implements an algorithm for finding the longest common subsequence of two sequences for use in implementing a diff algorithm.
The Hunt-Szymanski algorithm is probably the most efficient one for this purpose.
Comment #1
Posted on Apr 1, 2011 by Massive KangarooThis was done. See ZUZU.LIB.DIFF.
Status: Verified
Labels:
Type-Feature
Priority-Medium
Library-LIB
OpSys-All