3 ms·
There's a very old and strange approximate string matching algorithm in agrep (approximate grep). Here it is in its most simplified form (zero mismatches): ht
by bugfix-66 4y ago
There's a very old and strange approximate string matching algorithm in agrep (approximate grep).
Here it is in its most simplified form (zero mismatches):
https://bugfix-66.com/e61f9c6080791c9ea8983af748db704238cbb7afb9b5aa4d229e7c82bc4fa3a7 https://bugfix-66.com/e61f9c6080791c9ea8983af748db704238cbb7...
This might be the simplest and most elegant linear time string search algorithm.