inland bay
T(1) wont be appropriate right because in my case c(1)log(1) = 0
Should I state that the function does not exceed a certain value for small n and then since the behavior of T(n) is known for these base cases, we can just focus on proving the upper bound for larger n
any constant would work right?
In my case I could say T(n) >= c for n <= 2 when proving T(n) <= c n log n?
also is my inductive step correct? Im not rlly sure if Im on the right path
eager sleetBOT
inland bay
I was going over solution for another question and in the proof they came up with an assumption which let em skip the base case without explaining it. I think I am suppose to do something similiar here but im not sure how. This is that question and its solution:
