Multiple Choice
If f(n) = O(g(n) ) and g(n) = O(f(n) ) , what else must be true?
I f(n) = Ω(g(n) )
II g(n) = Ω(f(n) )
III f(n) = θ(g(n) )
A) I
B) II
C) I and II
D) I, II, and III
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q36: How many comparisons does selection sort make
Q37: If an element is present in an
Q38: Suppose an algorithm requires a total of
Q39: The code segment below is designed to
Q40: Which of the following arrays can be
Q42: After one iteration of selection sort working
Q43: A version of which sort algorithm is
Q44: A portion of your program includes the
Q45: Consider an array with n elements. If
Q46: Which sort algorithm starts by cutting the