Master's theorem is for recursive programs only. In general, there is no "golden" rule to calculate time complexity. Few pointers are to identify the key operations (eg - loops) and analyze the estimated running time based on a input size.
On Jul 27, 2:46 pm, rajeev bharshetty <rajeevr...@gmail.com> wrote: > Masters Theoremhttp://en.wikipedia.org/wiki/Master_theorem > > On Thu, Jul 28, 2011 at 1:14 AM, NITIN SHARMA <coolguyinat...@gmail.com>wrote: > > > Can anybody explain the basic steps that how to calculate the > > complexity of an algo so that i would be able to find complexity of > > any program???? > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algogeeks@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. > > -- > Regards > Rajeev N B <http://www.opensourcemania.co.cc> > > "*Winners Don't do Different things , they do things Differently"* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
