1.16 Points) True or false.
4096, 2048, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1
(a) 5n = O(n)
(b) n + 10n = O(n)
(c) 3n + 1 = O(n)
(d) 5n = n
(e) n = O(5n)
(f) 6n + n = n
(g) a = O(b), b > a > 1
(h) n = O(n)
Hint: f(n) = O(g(n)) Asymptotically, f(n) = Θ(g(n)) Asymptotically, f(n) = O(g(n)) Asymptotically, f(n) = Ω(g(n))
21
n^2
nlogn
n
logn
1
: 4
2
3
6
5
7
8