你即將離開本站

並前往https://stackoverflow.com/questions/39571091/log-base-3-time-search-algorithm

Log base 3 time search algorithm - Stack Overflow

True, O(log(n)) does not care whether log is base 2 or base 3. Assume now the task is to use no more than a certain number of comparisons.

確定！ 回上一頁

查詢 「Log3」的人也找了：

  1. log3怎麼算
    2.
  2. Log3
    3.
  3. Log5
    4.
  4. log2+log3 log6
    5.
  5. Log7
    6.
  6. log3/log2
    7.
  7. log1到10
    8.
  8. log7怎麼算
    9.