Return to Question

A large feedback has been taken from here.

A large feedback has been taken from here.

1. . (dot) means a any single character match
2. • (star) means 0 or more character match
3. ? (question) means previous char is an option ie colou?r matches color and colour.

I'm looking for code review, optimizations, best practices. I also still get confused with complexity. Let's say regex string has length of m and string has length of n. Then it appears the complexity would be O(n! * (n-1)! * ... (n-m)!)

1. . (dot) means a any single character match
2. * (star) means 0 or more character match
3. ? (question) means previous char is an option i.e colou?r matches color and colour.

I'm looking for code review, optimizations, best practices. I also still get confused with complexity. Let's say regex string has length of m and string has length of n. Then it appears the complexity would be O(n! * (n-1)! * ... (n-m)!)

A large feedback has been taken from here.

Looking for code review, optimizations, best practices. Also I still get confused with complexity lets say regex string had length of m and string had length of n then it appears the complexity would be O(n! * (n-1)! * ... (n-m)!)

A large feedback has been taken from here.

I'm looking for code review, optimizations, best practices. I also still get confused with complexity. Let's say regex string has length of m and string has length of n. Then it appears the complexity would be O(n! * (n-1)! * ... (n-m)!)