what algorithm, print it subsequently.... is there any ? On Fri, Jul 22, 2011 at 3:24 PM, DeeJJ..! <[email protected]> wrote:
> @sunny...yaa..but can u just describe the algorithm..:) > > On Jul 22, 2:51 am, sunny agrawal <[email protected]> wrote: > > n+(n-1) +(n-2)+........+1 = O(n^2) > > > > > > > > On Fri, Jul 22, 2011 at 3:16 PM, DeeJJ..! <[email protected]> > 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 you are subscribed to the Google > Groups > > > "Algorithm Geeks" group. > > > To post to this group, send email to [email protected]. > > > To unsubscribe from this group, send email to > > > [email protected]. > > > For more options, visit this group at > > >http://groups.google.com/group/algogeeks?hl=en. > > > > -- > > Sunny Aggrawal > > B-Tech IV year,CSI > > Indian Institute Of Technology,Roorkee > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
