Hello,
I wanted to know why the string::find(string pos, n) function is
implemented as O(n^2), instead of the KMP algorithm which is much
faster?
--
-Dhruv Matani.
http://www.geocities.com/dhruvbird/
Proud to be a Vegetarian.
http://www.vegetarianstarterkit.com/
http://www.vegkids.com/vegkids/index.html