Question

Give asymptotic upper bounds (in terms of O) for T(n) in each of the following recurrences. Assume that T(n) is constant for n < 2. Make your bounds as tight as posible. a) T(n)=T(H) +1; b) T(n) = T(n-1) + 1/n;

Answer 1

Solution :

3 lets Saj , log 2 Sumdỷ Hanma nic "(leg n) serits 2 klog long

if you have any doubts then you can ask in comment section if you find the solution helpful then upvote the answer. Thank you.