See https://en.wikipedia.org/wiki/Longest_common_substring_problem
John DeSoi, Ph.D. > On Aug 24, 2019, at 10:48 AM, Keith Culotta via 4D_Tech > <[email protected]> wrote: > > This version stands alone, and runs a little more efficiently. It's not been > tested in every way, but the results are encouraging. Interesting problem. > I can't think of a way to do it without comparing every character > combination. The new "Split string" command would speed part of this up if > Collections could be used. ********************************************************************** 4D Internet Users Group (4D iNUG) Archive: http://lists.4d.com/archives.html Options: https://lists.4d.com/mailman/options/4d_tech Unsub: mailto:[email protected] **********************************************************************
