The Gateway to Computer Science Excellence
+1 vote
156 views

A) Ω(n)

B) θ(n2)

C) Ω(n2)

D) θ(n)

in Puzzles by Junior (593 points) | 156 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)?
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
50,645 questions
56,601 answers
195,852 comments
102,219 users