Longest common sub sequence complexity O(n*n); Have you ever studied DAA ? On Fri, Jul 29, 2011 at 12:25 PM, sunny agrawal <[email protected]>wrote:
> String need to be contiguous or not ? > > > On Fri, Jul 29, 2011 at 12:23 PM, AMAN AGARWAL <[email protected]>wrote: > >> please give the solution for this problem....... >> >> Give an algorithm to find the Longest common string of strings with >> lengths m,n respectively and also analyse their time complexities >> >> -- >> AMAN AGARWAL >> "Success is not final, Failure is not fatal: It is the courage to continue >> that counts!" >> >> -- >> 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. > -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT ALLAHABAD -- 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.
