At work, we have code that runs in the browser to fuzzy search a list of database tables. It was slow. I rewrote it to use tries as an index, and it performs tw

At work, we have code that runs in the browser to fuzzy search a list of database tables. It was slow. I rewrote it to use tries as an index, and it performs two orders of magnitude faster. It also uses two orders of magnitude more memory, and returns unusual results in rare pathological cases. "Faster" doesn't need to mean "faster by every measure", it needs to mean that it's faster in the ways that matter given the constraints of the problem and what the program is trying to accomplish. The author of the code seems to have been very clear that this was a proof of concept around perceived performance of a specific aspect of the application, and I can't think of how the really doesn't satisfy that.