Running time of recursive algorithms

Hide text Hide pseudo-code
Analyse the worst case running time of the following three program fragments. Hint: use paper and pencil to form recurrences for the algorithms. Solve the recurrences, i.e., obtain asymptotic bounds for them in Big Oh notation. Finally, pick the corresponding verbal description for each solution.

  Created Fri Oct 30 13:52:50 EET 2009 - Powered by SVG-hut