Question

hich function is larger or eq plexity? No explanation required. (a) loglog n V.S. log n (b) log n! V.S. n log n (c) n1000 VS. 2 2 6 2 3 2, (20%) Give the Big O complexity of following functions. Justify your answer (a) T (n) (b) T(n) 47(n/4) + n. Tn) +1 h-0 2h+1 log ni 2 i (d) T(n)-? d Ouink Sort algorithm. Suppose X consists of elements x1 < x2 <

need help of the two question,better with some explanation ,thx a lot

Answer 1

I have anwered Q1.

Please repost other in separate post:

Q1.

a) (logn)^2  

b) logn!  

c) 2^n

d) T(n) = T(n/2) + T(n/3) + n