This preview shows page 1. Sign up to view the full content.
Unformatted text preview: of C. To check it we can use KMP algorithm. The complexity is O(|C|+|B|) = O(2n+n)= O(3n)=O(n)....
View Full Document
This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.
- Spring '03