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(
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
I think it's O(n).
Because the order of squareroot((log log m) / (log m)) is less than
m's.
T(n) = a T (n/b) + f(n)
1. O(n ^(lgb/lga) ) O(f(n))
T(n) = O(n ^(lgb/lga))
2. O(n ^(lgb/lga) ) = O(f(n))
T(n) = O(lg(n)*f(n))
3. O(n ^(lgb/lga) ) O(f(n))
T(n) = O(f(n))
The problem fits the 1st
Hi Ray,
Can u do this without using Master theorem?
I also need to fine the time complexity of problems like:
T(m) = 2T(m/2) + O( m^2 * squareroot((log log m) / (log m)) )
basically i need a solution without using master theorem.
Regards,
Phani
On 6/12/07, Ray [EMAIL
Don't know if the O-notation is also defined for complex functions.
Well, if it isn't, here's a possibility: - (please correct me if I am
wrong here.. )
For sqrt( x ) to be real, x needs to be 0
= log(log(m)) / log(m) 0
But we also know that log(m) log(log(m)) for all values of m for
which
See what you make with lights and bodies yes is like chinese shades.
Watch it at http://www.amusingclip.com/?vID=1181553781
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
Hi,
Many cryptography algorithm used prime to do the modular math, but I
don't know why it need to use prime but not many ordinary numbers?
Thanks
Bin
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm
