Can someone please explain to me (in email preferably):
1. how to find a recurrence from the algorithm
2. how to prove a recurrence using the master theorem
2a. how to decide which case to use
I am going crazy and none of this makes sense.
2 comments:
Wikipedia has pretty good writeups. See http://en.wikipedia.org/wiki/Recurrence_relation
and
http://en.wikipedia.org/wiki/Master_theorem
We will have to have a 454 party at ISS (so that way i can get paid)
-OR-
We can just do it at Nathans party, (so that way I can get drunk).
Post a Comment