2 votes 2 votes Given h(n) < f(n) < g(n). statement 1: h(n)=O(f(n)); g(n)=Ω(f(n)) Statement 1 is True / False? Algorithms asymptotic-notation algorithms time-complexity + – hacker16 asked Jan 21, 2018 • edited Jan 21, 2018 by hacker16 hacker16 911 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply MiNiPanda commented Jan 21, 2018 reply Follow Share 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.. 4 votes 4 votes hacker16 commented Jan 21, 2018 reply Follow Share thanks! 0 votes 0 votes Bharat Kapil commented Jun 9, 2019 reply Follow Share False.. Given case dont contain Tight Upper Bound & Tight Lower Condition If there is Small-Oh and Small- omega than It wil true 0 votes 0 votes lokeshsolanki17 commented Apr 29, 2020 reply Follow Share Bharat, big-Oh is a set which contains all upper bounds whether they are tight or not, similarly big-omega is a set which contains all lower bounds whether they are tight or not. small-oh and small-omega contains only "not tight" bounds accordingly 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes In 1st statement i guess its small o So may b false Utkarsh Gaikwad answered Jan 12, 2019 Utkarsh Gaikwad comment Share Follow See all 0 reply Please log in or register to add a comment.