Here's the key: Some shit is serious and I am serious when I talk about it because it requires the ability to be serious.
0 Members and 1 Guest are viewing this topic.
I'm going to sleep
Recursive, how do I do an inductive proof for this recurenceT(n) = T(n/2) + n n > 1 = 3 elsewisewhere n = 2^kI think the answer is nlg2n + 3 but I can't figure out the proof and feel dumb