- #1
IcyBlueRose
- 5
- 0
I'm having a problem with a Big-Oh problem, and I think it's more that I'm not understanding what the problem is asking and that I'm not completely understanding the definitions. There are two parts of the problem:
Here is the problem verbatim:
********************************************************
Assume you have functions f and g such that f(n) is O(g(n)). For each of the following statements, decide whether you think it is true or false and give a proof or counterexample.
A. log2 f(n) is O(log2 g(n)).
B. f(n)^2 is O(g(n)^2 ).
*********************************************************
(In part a the 2 is a subscript)
Does anyone have any pointers? The book I'm using doesn't give an example like it, so I'm not even really sure what it's asking.
Here is the problem verbatim:
********************************************************
Assume you have functions f and g such that f(n) is O(g(n)). For each of the following statements, decide whether you think it is true or false and give a proof or counterexample.
A. log2 f(n) is O(log2 g(n)).
B. f(n)^2 is O(g(n)^2 ).
*********************************************************
(In part a the 2 is a subscript)
Does anyone have any pointers? The book I'm using doesn't give an example like it, so I'm not even really sure what it's asking.