O(n^5) more interesting will be to find exact number of iterations ...
On Sep 10, 10:48 am, siddharam suresh <[email protected]> wrote: > first loop n > send loop n^2 > third loop n(i m not sure) > so n^4 > Thank you, > Sid. > > > > > > > > On Sat, Sep 10, 2011 at 11:09 AM, ravi maggon <[email protected]> wrote: > > I think it should be n^3 > > > On Sat, Sep 10, 2011 at 10:51 AM, Neha Singh > > <[email protected]>wrote: > > >> O(n^5) > > >> -- > >> 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 > > Ravi Maggon > > Final Year, B.E. CSE > > Thapar University > > > -- > > 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.
