For each of the time complexities in this segment give the tightest bound in terms of a simple poly-logarithmic function
Posted: Thu May 26, 2022 9:11 am
For each of the time complexities in this segment give the
tightest bound in terms of a simple poly-logarithmic function using
big-oh notation.
Note: use the ‘^’ symbol to indicate exponents, i.e., write
O(n^2) for O(n2).
T(n) = n/2 +100 log n
T(n) = 10,000 +log(300)
tightest bound in terms of a simple poly-logarithmic function using
big-oh notation.
Note: use the ‘^’ symbol to indicate exponents, i.e., write
O(n^2) for O(n2).
T(n) = n/2 +100 log n
T(n) = 10,000 +log(300)