induction proof for T(n) = T(n/2) + clog(n) = O(log(n)^2)

后端 未结 0 354
南方客
南方客 2021-01-30 01:31

log() = log base 2 of ()

log()^2 = log^2 base 2 of ()

Hi everybody, i\'m stuck with this induction proof

i have the following recurrence relation

T(n

相关标签:
回答
  • 消灭零回复
提交回复
热议问题