Tutorial 307 – Recurrence Equation of Merge Sort by Prof. Manjusha V Amritkar, faculty member of the Department of Information Technology, I Square IT, Pune

Prof. Majusha through this video talks about merge sort which is basically a Divide & Conquer Algorithm. Its recurrence equation is a Non-linear type of Recurrence. Its complexity is O(nlogn) in all cases that means that in the worst case, best case and in an average case, it is O(nlogn).

свернуть