0 votes 0 votes Will it be B or D? Algorithms algorithms asymptotic-notation test-series + – KISHALAY DAS asked Nov 12, 2016 • retagged Jul 13, 2022 by makhdoom ghaya KISHALAY DAS 472 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply saurabh rai commented Nov 12, 2016 reply Follow Share it will be B . 2 votes 2 votes KISHALAY DAS commented Nov 12, 2016 reply Follow Share Explain the difference? 0 votes 0 votes saurabh rai commented Nov 13, 2016 reply Follow Share Suppose an algorithm has time complexity T(n) of n3 so we can expree this like T(n) = Ω(1) or T(n) = Ω(n) or T(n) = Ω(n2) or T(n) = Ω(n3) all these r right but last one is more efficient . so Ω is a ntation to represent lower bound for an algorithm it may b tightest or not ..... and there is no any notation for tightest upper bound or lower bound explicitly.... and by just seeing T(n) = Ω(n) u cant predict that it is tightest lower bound r nt... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes How abt both? B) and D) since at times the i/p is near about, close enough and less than the worst case too. :) Devshree Dubey answered Nov 12, 2016 Devshree Dubey comment Share Follow See all 0 reply Please log in or register to add a comment.
