helloo,
i've been working on text diffing recently and wrote a solution for the Longest Common Subsequence problem.
I posted the solution amongst a couple of other programminglanguage-solutions at:
http://en.wikibooks.org/wiki/Algorithm_ ... quence#APL
Me and a friend got rid of an inner For-loop in the part "Computing the LCS length", my question is if anyone can figure out an even neater way to even get rid of the remaining for-loop =)