2 votes 2 votes Unknown Category algorithms asymptotic-notation time-complexity + – Shubham Pandey 2 asked Oct 26, 2016 Shubham Pandey 2 412 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes We derive Asymptotic Bounds For LARGER VALUES say n=10000000 (so here smallers have no importance) because large input is the case that an algorithm wants to analysis so here g1=O(n2) and g2=O(n3) so a is correct answer Aboveallplayer answered Oct 26, 2016 • selected Nov 3, 2016 by Aboveallplayer Aboveallplayer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Arjun commented Nov 3, 2016 reply Follow Share I think it is a typo in question. 0 votes 0 votes Aboveallplayer commented Nov 3, 2016 reply Follow Share yes that's true..and if not a typo then also the highest value should be taken in consideration..so answer should be same 0 votes 0 votes Arjun commented Nov 3, 2016 reply Follow Share given these options. Otherwise "None of these" should be the answer :) 0 votes 0 votes Please log in or register to add a comment.
