[algogeeks] subwords in a given word!

Q)complexity to find subwords in a given word? ex: abcde ans: a b c d e ab bc cd de abc bcd cde abcd bcde abcde -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

Re: [algogeeks] subwords in a given word!

n+(n-1) +(n-2)++1 = O(n^2) On Fri, Jul 22, 2011 at 3:16 PM, DeeJJ..! suryaprakash...@gmail.com wrote: Q)complexity to find subwords in a given word? ex: abcde ans: a b c d e ab bc cd de abc bcd cde abcd bcde abcde -- You received this message because