3 votes 3 votes This is a snapshot from coreman. Here if i want to prove this example $2n^2$ = $o(n^2)$ And if i take c=3, then $2n^2$ < $3n^2$ Now for all n0 and c=3 it will hold and this will be true .I know this proof i gave is wrong.But what exactly is wrong ? Algorithms algorithms asymptotic-notation time-complexity + – rahul sharma 5 asked Nov 14, 2017 rahul sharma 5 286 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply joshi_nitish commented Nov 14, 2017 reply Follow Share main thing to focus is a word-> for any positive constant c it means, it should hold for all the positive value of 'c', not only for few. 0 votes 0 votes Arjun commented Nov 14, 2017 reply Follow Share The description says "any positive c" and a fixed "$n_0$" but you took the reverse. 0 votes 0 votes rahul sharma 5 commented Nov 14, 2017 reply Follow Share Thanks.i confused with big o,which says "there exists positive constant c",but here it is "any positive c" 0 votes 0 votes joshi_nitish commented Nov 14, 2017 reply Follow Share @Arjun sir, is it correct to say that if a bound is not tightest upper bound, than that bound will always be small-Oh (o) ? 0 votes 0 votes Please log in or register to add a comment.