0 votes 0 votes device a binary search algorithm which splits the set not into 2 sets of almost equal size but into 2 sets of size one third and two third. what is the time complexity of the algorithm? a)theta(nlogn) b)theta(n) c)theta(logn) d)theta(n^2) bhautikng143 asked Jan 19, 2019 bhautikng143 502 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Sasta_yoda commented Jan 19, 2019 reply Follow Share We can assume the worst case to be T(n)= T(2n/3)+c (c being some constant), you can apply master's to this and you'll get the same answer then also. 0 votes 0 votes bhautikng143 commented Jan 19, 2019 reply Follow Share Thanks:) 0 votes 0 votes Sasta_yoda commented Jan 19, 2019 reply Follow Share Perhaps you can consider upvoting if your query was resolved! :) 0 votes 0 votes Please log in or register to add a comment.