0
Aurelia Stracke β
The time complexity of the algorithm with the recurrence relation t(n) 2t(n/4) n is O(n log n).
AnswerBot