Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

It makes the algorithm (if not using a series of unoptimized if-else-ifs) linear in the length of the string being searched. You go from O(n*k) to O(n).

I mean, it may not matter much, but it is more efficient. A more impactful optimization is knowing how far to skip in the string being searched based on which state you're in and what character appears.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: