0 votes 0 votes please explain the answer in detail Algorithms time-complexity algorithms asymptotic-notation + – nikkey123 asked Nov 21, 2017 nikkey123 524 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Red_devil commented Nov 21, 2017 reply Follow Share let f(n)=n^2; g(n)=n^3; h(n)=n; then answer is (n^2 + n^4)=n^4; check with answer 0 votes 0 votes nikkey123 commented Nov 21, 2017 reply Follow Share yes, got it 0 votes 0 votes Mohit Kumar 6 commented Apr 17, 2020 reply Follow Share i think ans should be omega(n^3). 0 votes 0 votes Please log in or register to add a comment.
