← 回題庫

卷別

資料結構與演算法

選擇

國立臺灣大學 2025 · 考試 · 第 9 題

考科演算法

(5 points) Select all the correct statement(s) from the following statements regarding recurrence.

  • (A)
    The solution to the recurrence T(n)=2T(n/2)+Θ(n)T(n) = 2T(n/2) + \Theta(n) is Θ(n2)\Theta(n^2).
  • (B)
    The solution to the recurrence T(n)=7T(n/2)+Θ(n2)T(n) = 7T(n/2) + \Theta(n^2) is Θ(nlg⁡7)\Theta(n^{\lg 7}).
  • (C)
    The solution to the recurrence T(n)=log⁡n+T(n)T(n) = \log n + T(\sqrt{n}) is Θ(log⁡n)\Theta(\log n).
  • (D)
    The solution to the recurrence T(n)=2nT(n−1)T(n) = 2^n T(n-1) is Θ((2)n2+n)\Theta((\sqrt{2})^{n^2+n}). (Assume T(n)=1T(n) = 1 for nn smaller than some constant cc.)
  • (E)
    The solution to the recurrence T(n)=T(n/6)+T(7n/9)+O(n)T(n) = T(n/6) + T(7n/9) + O(n) is O(n)O(n). (Assume T(n)=1T(n) = 1 for nn smaller than some constant cc.)

標準解析

AI 已複查