2 votes 2 votes plz help me . how to solve that type of question Algorithms algorithms asymptotic-notation test-series + – 92komal asked Jan 26, 2018 • retagged Jul 13, 2022 by makhdoom ghaya 92komal 385 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply sumit chakraborty commented Jan 26, 2018 reply Follow Share $\Omega (n^{3})$ 0 votes 0 votes gauravkc commented Jan 26, 2018 reply Follow Share How ? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I have a trick F(n)+ (g(n) * h(n)) F(n)+min(thetae n2 , bigoh n2) F(n)+ theta n2 Now max( f(n), theta n2) (Omega n) Hope u got this akankshadewangan24 answered Jan 26, 2018 akankshadewangan24 comment Share Follow See 1 comment See all 1 1 comment reply Saswat Senapati commented Jan 27, 2018 reply Follow Share will max ( omega n , theta n2) be omega n or theta n2? 0 votes 0 votes Please log in or register to add a comment.