CS2
Week 5: Algorithm analysis, searching, sorting
14
Problem
nSuppose we have a method whose worst running time worstTime(n) is a given function in n. Determine the effect of tripling n on the estimate of worst time. That is, estimate worstTime(3n) in terms of worstTime(n) if
n1)  WorstTime(n) is linear in n
n2)  WorstTime(n) is quadratic in n
n3)  WorstTime(n) is constant