GATE | GATE-CS-2004 | Question 83
The time complexity of the following C function is (assume n > 0)
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.
(B) O(n log n)
See Question 4 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-4/
This solution is contributed by Anil Saikrishna Devarasetty