Loading...

algogeeks@googlegroups.com

[Prev] Thread [Next]  |  [Prev] Date [Next]

[algogeeks] Re: Time complexity Phanisekhar B V Tue Jun 12 06:05:55 2007

Adiran, Yes u r right. Let T(1) = 1.


On 6/12/07, Adrian Godong <[EMAIL PROTECTED]> wrote:
>
> You should provide the limit/point where T(m) is constant.
>
> Say T(1) = 1, or something else. Only then we can calculate the time
> complexity.
>
>
> On 6/12/07, Phanisekhar B V <[EMAIL PROTECTED]> wrote:
>
> > How can i calculate the time complexity of the following problem?
> >      T(m) = 2T(m/2) + O( squareroot((log log m) / (log m)) )
> >
> > The above problem contains double log and squareroot.
> >
> >
> > Regards,
> > Phani
> >
> >
> >
> >
> > Microsoft MVP
> > <https://mvp.support.microsoft.com/profile/Adrian>
> > https://mvp.support.microsoft.com/profile/Adrian
> > > >
> >

--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---