Fix runtime complexity of LongestCommonSeqImpl.scala

vickumar1981 / stringdistance

A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..

https://vickumar1981.github.io/stringdistance/api/com/github/vickumar1981/stringdistance/index.html

Other

78 stars 15 forks source link

Fix runtime complexity of LongestCommonSeqImpl.scala #65

Closed vickumar1981 closed 3 years ago

vickumar1981 commented 3 years ago

Reduces runtime complexity of LongestCommonSeq for two arrays, n, and m to O(n*m)
Addresses: https://github.com/vickumar1981/stringdistance/issues/64

coveralls commented 3 years ago

Pull Request Test Coverage Report for Build 252

8 of 8 (100.0%) changed or added relevant lines in 1 file are covered.
No unchanged relevant lines lost coverage.
Overall coverage increased (+1.3%) to 98.708%

Totals
Change from base Build 244:	1.3%
Covered Lines:	382
Relevant Lines:	387

vickumar1981 / stringdistance

Fix runtime complexity of LongestCommonSeqImpl.scala #65

Pull Request Test Coverage Report for Build 252

💛 - Coveralls