煩請幫我解答以下題目: 十分感激!?
回答 (1)
2018-03-04 10:49 pm
✔ 最佳答案
It's big-Oh is O(log n). This conclusion can be easily derived by deduction process on value k.When K = 0. O(log 1) is true.
That "K = m, O(log 2^m) is true" implies "k=m+1, O(log 2^(m+1))" is also true.
收錄日期: 2021-04-18 18:07:38
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20180304082036AADX4YA