1 votes 1 votes closed with the note: Violation of community guidelines https://gateoverflow.in/blog/2113 T(n)=sqrt(2T(n/2))+logn Algorithms ace-booklet time-complexity recurrence-relation + – Ankush Tiwari asked Jul 27, 2016 • closed Aug 15, 2017 by Tesla! Ankush Tiwari 665 views comment Share Follow See all 4 Comments See all 4 4 Comments reply rude commented Jul 27, 2016 reply Follow Share do not worry this will never be asked in gate. this is shit. 5 votes 5 votes One commented Sep 9, 2016 reply Follow Share right rude haha :) 0 votes 0 votes Shubhanshu commented Aug 15, 2017 reply Follow Share Do you mean to say:- $T(n) = \sqrt2T(\sqrt\frac{n}{2}) + logn$ 0 votes 0 votes sumit goyal 1 commented Aug 15, 2017 reply Follow Share :P lol 0 votes 0 votes Please log in or register to add a comment.