It seems that the algorithms are O(Nk) where N is size of document and k is number of keywords needed. So this means if you are looking for a N/2 words in a document of length N, the worst case will actually be O(N^2). Not something that you'll get from a google query, but still possible for this sort of algo's.
On Feb 14, 5:14 am, Andrey <[EMAIL PROTECTED]> wrote: > Yes! > Look here there is a > program:http://groups.google.com/group/algogeeks/browse_thread/thread/11b032a... > > On Feb 13, 3:16 am, conundrum <[EMAIL PROTECTED]> wrote: > > > Given a text and a set of keywords, is there a linear time algorithm > > to find the smallest subtext containing all the keywords (at least > > once) ? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
