- Rank the following functions by order of growth; that is, find an arrangement g1, g2, …, g30 of the functions satisfying g1 = Ω(g2), g2 = Ω(g3), …, g29 = Ω(g30). Partition your list into equivalence classes such that functions f(n) and g(n) are in the same class if and only if f(n) = Ѳ(g(n)).
- Give an example of a single non-negative function f(n) such that for all functions gi(n) in part (a), f(n) is neither O(gi(n)) nor Ω(gi(n)).
We need a function f that looks like this:
when f grows faster then 22n then f != O(any function above) because f = Ω(0), 0 is not in the candidates, we can simply choose