1 vote
212 views

A) Ω(n)

B) θ(n2)

C) Ω(n2)

D) θ(n)

in Puzzles
0
it is $\Omega (n)$
0
yes..
0
utkarsh share approach  :P
0
got it  was doing some mistake
0

why not  θ(n2) ? pls explain.

0
what can be the Ω of this equation?

f(n) can perform Ω(1), g(n) can perform Ω(n) and h(n) can perform Ω(n)

time complexity will be Ω(n)

we cannot determine time complexity in $\Theta$ because we don't know $\Theta$ of f(n) and g(n)
0
how did you assume f(n) is Ω(1)  and h(n) is Ω(n)?

## Related questions

1
257 views
Given a non negative integer A, following code tries to find all pair of integers (a, b) such that a and b are positive integers a <= b, and a2 + b2 = A. 0 <= A <= 100000 However, the code has a small bug. Correct the bug and submit the code. vector<vector<int> > ... a + b * b == A) { vector<int> newEntry; newEntry.push_back(a); newEntry.push_back(b); ans.push_back(newEntry); } } } return ans; }