1) Use a method (either summation, substitution, or master method) to solve each T(n) of the...

 

Transcribed Image Text:

1) Use a method (either summation, substitution, or master method) to solve each T(n) of the following recurrence relations. You need to show clear steps to justify your answers. If you encounter an irrational number, leave as it is, for example, 13, Igs7, etc. (a) T(n) 4T(n/2)+n (b) T(n) 67(n/2)+ = n Ign (c) T(n) 8T(n/3) + nlgn n (d) T(n) 8T(n/4)+ (e) T(n) 7T(n/2) + n = (f) T(n) T(n/4)+ 1 Ign (g) 7(n) 167(n/3)+nign = (h) T(n) 8T(n/4)+nn Reference: O notation: asymptotic "less than": notation: asymptotic "greater than": notation: asymptotic "equality": f(n) "" g(n) f(n) ""g(n) f(n) ""g(n) 1) Use a method (either summation, substitution, or master method) to solve each T(n) of the following recurrence relations. You need to show clear steps to justify your answers. If you encounter an irrational number, leave as it is, for example, 13, Igs7, etc. (a) T(n) 4T(n/2)+n (b) T(n) 67(n/2)+ = n Ign (c) T(n) 8T(n/3) + nlgn n (d) T(n) 8T(n/4)+ (e) T(n) 7T(n/2) + n = (f) T(n) T(n/4)+ 1 Ign (g) 7(n) 167(n/3)+nign = (h) T(n) 8T(n/4)+nn Reference: O notation: asymptotic "less than": notation: asymptotic "greater than": notation: asymptotic "equality": f(n) "" g(n) f(n) ""g(n) f(n) ""g(n)