Skip to content

Latest commit

 

History

History
26 lines (17 loc) · 2.2 KB

p5.md

File metadata and controls

26 lines (17 loc) · 2.2 KB

Problem

  1. 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)).
    log(log^*(n)), 2^(log^*(n)), (sqrt(2))^logn, n^2, n!, (logn)!,
    (3/2)^n, n^3, log^2(n), log(n!), 2^2^n, n^(1/logn),
    ln(ln(n)), log^*(n), n·2^n, n^loglogn, ln(n), 1
    2^logn, (logn)^logn, e^n, 4^logn, (n+1)!, sqrt(logn),
    log^*logn, 2^sqrt(2logn), n, 2^n, nlogn, 2^2^(n+1)
  2. 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)).

Solution

1

magic

2

We need a function f that looks like this:

magic

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

magic