Hi evry1,
I need help for these problems. If anyone knows to solve ls help me out.
Prove Σ i=0..d aini =Θ(nd) where ai are constants and ad>0. (Note:
you need to find c1, c2, and n0).
(A) Group the following so that f and g are in the same group if and only if
f=Θ(g). (List the groups formed from the lowest to highest rank.)
(B) List all the functions that are O(n2) but not O(n).
n+2n/lg n+lg n, 3lg lg n, 2n+n/lg n, lg lg(n2), (3 lg lg n)2, n3-n2lg n, 2n, 12
n lg(n2)-4n, n16/3, 4n+12nlg n, 2n+n35, n2n.
I need some online websites that gives me in detail abt the algorithm,time
complexity and other details in brief. Do help me out.
Thanx alot inadvance.
Warm Regards
Swetha
---------------------------------
Check out the all-new Yahoo! Mail beta - Fire up a more powerful email and get
things done faster.
