Performance of Regular Expressions

medium.com

5 pointsmrzasa2 comments

Isn't it O(n) where n is the length of the string to match? Because you can compile any regex to a DFA and run it over the string.

Not sure what you mean. For detailed complexity analysis, please read this excellent post by Russ Cox: https://swtch.com/~rsc/regexp/regexp1.html