i guess he substitutes it so that i matches the recurrence T(n) by multiplying by 2 and adding n, has something like: 2 T(\lfloor n / 2 floor)+n \leq 2 c\lfloor n / 2 floor \lg (\lfloor n / 2 floor)+n, and then just calls 2 T(\lfloor n / 2 floor)+n = T(n), because that is how it's defined
Thanks and I also have a question. about the 14:47 example. First, let's make the problem simpler but still have the point which I confused about. T(n) = 2T(n/2) + 1 T(n)
Thank you for this great lecture sir!
4:15, how did you get the equation after substitution?
Pro tip: watch series at flixzone. Been using them for watching all kinds of movies these days.
@Braydon Nathanael yea, I have been watching on Flixzone for since november myself =)
i guess he substitutes it so that i matches the recurrence T(n) by multiplying by 2 and adding n, has something like: 2 T(\lfloor n / 2
floor)+n \leq 2 c\lfloor n / 2
floor \lg (\lfloor n / 2
floor)+n, and then just calls 2 T(\lfloor n / 2
floor)+n = T(n), because that is how it's defined
Thanks and I also have a question. about the 14:47 example.
First, let's make the problem simpler but still have the point which I confused about.
T(n) = 2T(n/2) + 1
T(n)
Thanks for the presentation, very useful and understandable