I didn\'t get the answer to this anywhere. What is the runtime complexity of a Regex match and substitution?
Edit: I work in python. But would like to know in genera
Depends on the implementation. What language/library/class? There may be a best case, but it would be very specific to the number of features in the implementation.