Time complexity

Question

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)

Comments

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.

---

Thanks:)

---

Perhaps you can consider upvoting if your query was resolved! :)