Kinds of Growth Here are some common orders of growth, ranked from no growth to fastest growth 1. e(1) constant time takes the same amount of time regardless of input size 2. (log n)-logarithmic time 3. e(n)-linear time 40(n log n)-linearithmic time 60(n3 ), polynomial time 7.0(2), (3"), etc.-exponential time (considered "intractable", these are really, really horrible) 8. Something else not listed etc. - Question 1.7 Calculate the complexity for foo(bar(n). To see pattern I'd suggest you to take different inputs for n and write down the recursion tree. def bar(n) if n%21: return n +1 return n def foo(n)) if n alist[i+1): alist[l), alist[i+1] alist[i+1], alist[)