Re: Longest Common Substring Problem - Should it go in source/ or in include/std?

new topic     » goto parent     » topic index » view thread      » older message » newer message

The whole file is 150 line long but 100 of them are comments. It is actually generalized to be the solution to the longest common subsequence problem. You could have two sequences of ordered number pairs and find the longest subsequence of that.

The function names are currently named LCSubstr_fast, and LCSubstr. Eutest only uses LCSubstr_fast. I'll leave it in source/lsccp.e for now.

new topic     » goto parent     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu