i'm building my own console with a 12 core zen 3 and an rtx 3080 called the asschewer 40k because it chews the ass off of soyny greystations and micropenis pissboxes.stay drooling nerds. i've got pussy to wade in.
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