Summary: University of Wuppertal
Faculty C -- Department of Mathematics
Dr. Holger Arndt, Dipl.-Math. Sigrid Fischer
Algorithms and Data Structures
WS 2004/2005
Exercise Sheet 2
Exercise 4 (6 p.) Show: If the recursive formula
T(n) =
O(1) if n = 1
k · T(n - 1) + O(n
) if n > 1
with fixed k N and 0 holds, then also does the explicit formula:
T(n) =
O(n+1
) if k = 1
O(kn
· n
) if k > 1
Hint: You should get an intermediate result of the kind
T(n) = kn-1

Source: Arndt, Holger - Fachgruppe Mathematik, Fachbereich Mathematik-Naturwissenschaften, Bergische Universität Wuppertal

Collections: Computer Technologies and Information Sciences