From: Nicolas C. <war...@fr...> - 2003-05-22 09:54:49
|
> > val find : string -> string -> int (* find a substring *) > > Using KMP or some other technique? (i.e. if it takes O(m * n), where m and > n are lengths of strings respectively? or O(log m * n + m)) Right now only a naive O(m*n) technique. Please check the CVS, and submit me some code if you have a better implementation. Nicolas Cannasse |