For each of the time complexities in this segment give the tightest bound in terms of a simple poly-logarithmic function

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

For each of the time complexities in this segment give the tightest bound in terms of a simple poly-logarithmic function

Post by answerhappygod »

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)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Top
Post Reply

Return to “Archived Questions & Answers”