[algogeeks] How to Monetize your site / Blog ?

Hi, Learn to monetize your site / blog with the best. Click here to find the review. -- Yours Sincerely Team, Share N Care Blog. Please do not mark us as SPAM.If you wish to unsubscribe from our mailing list

[algogeeks] What is Medicare Part D ? Am I Eligible ? Answers

Hi, Answers to this very important question + Free Comparison Tool for Medicare Part D + Link for free Natural Heath Supplement samples. Click Here. -- Yours Sincerely Team, Share N Care Blog. Please do

[algogeeks] Re: Stortest Subtext Problem

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

[algogeeks] Re: Stortest Subtext Problem

Yes! Look here there is a program: http://groups.google.com/group/algogeeks/browse_thread/thread/11b032a28995baed/7b896ee015b090e5 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 contain