So it's a "string contains string" function in Javascript? I mean, that's great, and this seems like a simple and clean implementation, but is it really worthy of a hacker news post? It seems like the answer to a stack overflow question.
fuzzysearch('twl', 'cartwheel') // <- true
new RegExp("twl".split("").join("(.+)?")).test("cartwheel")
You can also use ".*" to replace "(.+)?" in your regex.
"anyone" with over 400 bytes, you mean.
Our jobs are real-time where the user is awaiting a response. So probably not limiting factor for jobs that can be run on your own time.
If you're building your own search engine, which you probably shouldn't, I'd look elsewhere.
Advice not taken.
I don't follow, since that's pretty much the definition of "fuzzy search". Your algorithm considers the query to be similar to the searched text if the latter contains all the characters in query in the same order.
If the use case is just to allow users to type the first few letters of each word or something, that algorithm works great, so advising "anyone" to look elsewhere didn't make sense.
If users expect to be able to make typos other than leaving out characters, though, it doesn't work, and that's often what people think of when they see "fuzzy search". I just wanted to point out that you could use Levenshtein + a BK-Tree or something and get those results if desired, though, yeah, it'd definitely be more complicated, but I doubt it'd be too slow.