in the brute force pattern matching algorithm when all the characters in the pattern are unique then brute force can be implemented in Big-oh(n) complexity where n is the length of the string( reference :introduction to algorithms). can anyone help me with the algorithm? thanks in advance
↧