The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
203 views
Given  h(n) < f(n) < g(n).

statement 1: h(n)=O(f(n)); g(n)=Ω(f(n))

Statement 1 is True / False?
asked in Algorithms by Active (2.6k points)
edited by | 203 views
+3
h(n)= O(f(n)) implies that h(n)<=c f(n) --(i)

g(n)=Ω(f(n)) implies g(n)>=c f(n) --(ii)

Where c is a constant.

Given is that h(n)<f(n)<g(n)

So from (i) and (ii) you can see that is valid..
0
thanks!
0
False..

Given case dont contain Tight Upper Bound & Tight Lower Condition

If there is Small-Oh and Small- omega than It wil true

1 Answer

0 votes
In 1st statement i guess its small o

So may b false
answered by (23 points)

Related questions

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
49,582 questions
54,192 answers
187,527 comments
71,147 users