2 votes 2 votes Algorithms asymptotic-notation algorithms time-complexity test-series + – Pavan Kumar Munnam asked Aug 12, 2017 retagged Jul 13, 2022 by makhdoom ghaya Pavan Kumar Munnam 569 views answer comment Share Follow See 1 comment See all 1 1 comment reply saxena0612 commented Aug 12, 2017 reply Follow Share Thetha small omega small omega small o 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes a) Theta b) Both Big and small Omega applicable --> small Omega c)Both Big and small Omega applicable --> small Omega d)Both Big and small O applicable --> small O VS answered Aug 12, 2017 VS comment Share Follow See all 2 Comments See all 2 2 Comments reply ashutoshaay26 commented Aug 14, 2017 reply Follow Share @VS Can you elaborate a method behind your answer? 0 votes 0 votes rajatmyname commented May 2, 2018 reply Follow Share @VS how exponential function (2^n) is smaller than polynomial function(n^6)? 0 votes 0 votes Please log in or register to add a comment.