f(n)=Ω(n),g(n)=O(n) than what is f(n).g(n)
SInce f(n)=Ω(n) ---> f(n) $\geq$ c1n
and g(n)=O(n) ---> g(n) $\leq$ c2n
f(n).g(n) = Ω(n) but we can't say anything about Big-oh notation as f(n) can be n2.n3,2n, etc.
@Niraj Singh 2Usually we consider non-decreasing functions, so the answer is correct.
64.3k questions
77.9k answers
244k comments
80.0k users