# Question & Answer: Textbook: Introduction to Algorithms (3rd edition) by T. Cormen, C. Leiserson, R. Rivest and C. Stein, MIT Press, 2009…..

Textbook: Introduction to Algorithms (3rd edition) by T. Cormen, C. Leiserson, R. Rivest and C. Stein, MIT Press, 2009

Show all work (if necessary).

Don't use plagiarized sources. Get Your Custom Essay on
Question & Answer: Textbook: Introduction to Algorithms (3rd edition) by T. Cormen, C. Leiserson, R. Rivest and C. Stein, MIT Press, 2009…..
GET AN ESSAY WRITTEN FOR YOU FROM AS LOW AS \$13/PAGE

2. Fill the following blanks with the notations O, o, Ω, w, or Θ. Use o if both O and o are applicable. Use w if both Ω and w are applicable. Use Θ if both Ω and O are applicable. To distinguish O and o, write “big-O” for O (2 log n) (n2) (2n) a) n= b) 0.2n_ c) 2n= d) 2n log n = (n6) Solution. Your solution here.

$a) n = \theta(2n)$ — both $\Omega,$O are correct
$b) 0.2n = \omega(2 logn)$ —both $\Omega , \omega$ are correct
$c)2^{^{n}} = \omega(n^{^{6}})$   — both $\Omega , \omega$ are correct
$d)2nlogn = o(n^{2}))$ —both O and o are correct