Awesome q2a theme
0 votes
21 views
Let $g(n) = \Omega(n)$, $f(n) = O(n)$ and $h(n) = \theta(n)$ then what is the time complexity of $[g(n) f(n) + h(n)]$

How to solve such questions?
in Algorithms by (179 points) | 21 views

1 Answer

0 votes
I think that we can only say that time complexity is $\Omega (n)$ as we can not find upper bound from information given can figure out just lower bound.
by (916 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Apr 2020
  1. Kushagra गुप्ता

    36 Points

  2. !KARAN

    36 Points

  3. Ram Swaroop

    36 Points

  4. sushmitagoswami

    6 Points

  5. ConnieSincla

    5 Points

  6. MelinaCundif

    5 Points

  7. Lolita04I641

    5 Points

  8. JackiBandy49

    5 Points

  9. skbansal97

    5 Points

  10. Rijusen

    5 Points

3,522 questions
1,658 answers
10,465 comments
90,046 users