search

dajmcdon / rtestim

https://dajmcdon.github.io/rtestim/
Other
4 stars 0 forks source link

faster "almost_match" #35

Closed zcaiElvis closed 1 year ago

zcaiElvis commented 1 year ago

Current almost_match takes O(n^2). If we sort both lists first and do a binary search of every element from one list to another, this will be O(nlogn)

dajmcdon commented 1 year ago

Seemingly no longer used.