2 votes 2 votes Algorithms made-easy-test-series algorithms recurrence-relation time-complexity + – charul asked Nov 11, 2017 • edited Mar 4, 2019 by adeebafatima1 charul 709 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply saxena0612 commented Nov 11, 2017 reply Follow Share Is it B) $\Theta (n)$ 0 votes 0 votes charul commented Nov 11, 2017 reply Follow Share Given answer is option A 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes Solution Shivam Chauhan answered Nov 12, 2017 • selected Nov 12, 2017 by Shivam Chauhan Shivam Chauhan comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Shivam Chauhan commented Nov 12, 2017 reply Follow Share First of all congrats, Bro, you are already giving FLT. I am still completing the syllabus. For above question take your mentioned Case1 as the answer since it gives higher complexity. Or Let's leave it as ambiguous(It's definitely not wrong). 0 votes 0 votes Rishabh Gupta 2 commented Nov 12, 2017 reply Follow Share If it was Big-Oh instead of theta, then Option A should be correct. Right? 0 votes 0 votes Shivam Chauhan commented Nov 12, 2017 reply Follow Share @joshi_nitish Please also look at following question. https://gateoverflow.in/169044/time-complexity 0 votes 0 votes Please log in or register to add a comment.
