4 ms·
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.
by tsuberim 8y ago
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.
- mrzasa 8y agoNot sure what you mean. For detailed complexity analysis, please read this excellent post by Russ Cox: https://swtch.com/~rsc/regexp/regexp1.html https://swtch.com/~rsc/regexp/regexp1.html