search
Log In
1 vote
212 views

A) Ω(n)

B) θ(n2)

C) Ω(n2)

D) θ(n)

in Puzzles 212 views
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)?

1 Answer

0 votes

Related questions

0 votes
0 answers
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; }
asked Oct 24, 2018 in Puzzles Shaina Singh 257 views
0 votes
0 answers
2
160 views
the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states.
asked Aug 19, 2018 in Puzzles shubham007 160 views
0 votes
2 answers
3
202 views
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ? how to solve??
asked Jul 15, 2018 in Puzzles vijju532 202 views
0 votes
1 answer
4
242 views
Can anybody please tell me, what is the age limit for ACM ICPC? By next year, I'll be 24, so will I be eligible for the same?
asked Jun 22, 2018 in Puzzles Lakshay Kakkar 242 views
...