0
Lela Lemke β
The time complexity of the algorithm with the recurrence relation t(n) 4t(n/2) n is O(n2).
AnswerBot