0 votes 0 votes For f(n)= 2n2+3n , O(n3) and o(n3) both are correct then what do both mean in this. As Big oh is used to reprsent the tighest upper upper bound but it is not representing here so what do we mean by O(n3) and o(n3). Algorithms algorithms asymptotic-notation + – P Srinivas Rao asked Oct 9, 2016 P Srinivas Rao 311 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes small o is used to represent tightest upper bound.. for big oh...if A=O(B)...it means B>=A thus if f(n)=O(n square).....f(n)=O(n cube)...and so on till f(n)=O(2 power n) sudsho answered Oct 9, 2016 sudsho comment Share Follow See all 2 Comments See all 2 2 Comments reply cse23 commented Oct 14, 2016 reply Follow Share O(n3) and o(n3) : o(n3) is more stricter than O(n3) for any function A and B: if A = O(B) means A<= c *B for any c>0 and n>n0 where n0>0 which is the point where A intersesct B if A = o(B) means A< c *B for any c>0 and n>n0 1 votes 1 votes sudsho commented Oct 14, 2016 reply Follow Share @cse23...i said the same:) 0 votes 0 votes Please log in or register to add a comment.