*****, good question! I was using the Change of Base property in order to get both sides of the inequalities to have the same base. Here's an example: n * log_3(n) = n * (log_10(n) / log_10(3)) = (n / log_10(3)) * log_10(n) Hope this helps! Thanks for watching!
You gotta show that "logarithmic manipulation".
As well as the "This part ends up being linear".
@derek-rogers I guess, it's cuz bn*(log_3(n) + 1) + 2^(log_3(n)) < bn*(log_3(n) + 1) + 3^(log^3(n)) =bn*(log_3(n) + 1) + n (from log properties, log_a(a^x) = x) hence it's
bn*(log_3(n) + 1) + linear. We only care aboht significant terms, hence it's O(n*log_3(n))
Lots of help, thank you!
ragnarok1694, no problem! Thanks for watching!!
Been watching all of your vids for the upcoming test :) Can I ask what log property you used for the end solution?
*****, good question! I was using the Change of Base property in order to get both sides of the inequalities to have the same base. Here's an example:
n * log_3(n) = n * (log_10(n) / log_10(3)) = (n / log_10(3)) * log_10(n)
Hope this helps! Thanks for watching!
Solid video, zooce
finally English accent!!! p.s ( i still love you indian computer science teachers :P )
That's a really good video, implying I have been watching a lot of vids on Recursion. :D
Good explanation :)
At the end you are not adding the cost of leaves
I don't think both of those summations are linear.
How is 2^(log(3/2)n) linear?
+f(n)
right? right? right? right? so insufferable.