3 votes 3 votes time complexity questions like : h(n)=O(n2); f(n)= O(logn); g(n)=omega(n2); what is the complexity of :::: 1. h(n)-g(n)=?? 2. h(n)-f(n)=??? elaborate plz Algorithms time-complexity asymptotic-notation + – akankshadewangan24 asked Jan 22, 2018 akankshadewangan24 395 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Anu007 commented Jan 22, 2018 reply Follow Share From where you got this , h(n)-g(n)? I dont think this can be computed, we generally add complexity but not substracted. I think (1) O(n2) and for (2) o(n2) 1 votes 1 votes akankshadewangan24 commented Jan 22, 2018 reply Follow Share There is no concept of substratction in complexity??????? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Subtraction doesn't affect the Bound 1. h(n)-g(n)=Ω (n2) as we have a lower bound on g(n) 2. h(n)-f(n)=Ο (n2), max(h(n),f(n)) aakashpreetam answered Apr 10, 2018 aakashpreetam comment Share Follow See all 0 reply Please log in or register to add a comment.