CSE 143, Quiz 8 09 Aug 2000
name ____________________________________________ student number _______________
section __________
This quiz is closed book, closed notes. You have six minutes. Write your
answers neatly on this page.
For each complexity function below, write the asymptotic complexity (using big-O
notation):
fa(n) = 0.5 log n + 4 (1 + 2 + 3 + ... + n)
fa(n) =
fb(n) = 3 n + (2 n - 0.5) log n + 256
fb(n) =
fc(n) = 0.1 (n + 1)3 + 128 n log n - 0.001
fc(n) =
fd(n) = log n + log (2 n) + 4
fd(n) =
Using the letters identifying each function, list the functions in order of
increasing complexity, i.e. from slowest growing to fastest growing.
_____, _____, _____, _____