From d83cb7b85f72ddb61a6c4bbacef3c1bc3b75d1fb Mon Sep 17 00:00:00 2001 From: Devin Jeanpierre Date: Sat, 4 May 2013 19:11:35 -0700 Subject: [PATCH] Updated Lib re (markdown) --- Lib-re.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Lib-re.md b/Lib-re.md index c861f4f..acc6fde 100644 --- a/Lib-re.md +++ b/Lib-re.md @@ -42,7 +42,7 @@ Pike VM and Laurikari TNFA are apparently similar techniques. I am not very fami (Performance details are given where m is the size of the regex, and n is the size of the string being matched.) -Backtracking search is the simplest to implement and has the least overhead when nothing goes wrong. However, in the presence of a few regex operators and bad input, it also has the worst performance, with worst case O(2^n) time and O(n) space. +Backtracking search is the simplest to implement and has the least overhead when nothing goes wrong. However, in the presence of a few regex operators and bad input, it also has the worst performance, with worst case O(2^n) time and O(n log m) (?) space. Pike VM / TNFA have more overhead, but worst-case O(nm) time and O(m) space complexity. They can't implement backreferences, and may not be able to implement zero width assertions.