Merge Sort Time Complexity Using Masters Method

For Complete YouTube Video: Click Here

In this class, we will try to understand Merge Sort Time Complexity Using Masters Method.

In our previous classes, we have already discussed the Merge Sort Time Complexity Using Substitution Method and Masters method.

Merge Sort Time Complexity Using Masters Method

The image below shows all the equations of the master’s method.

The recurrence equation for the merge sort is shown below.

In our previous class, we discussed the derivation of the recurrence relation for the merge sort.

From the above equations 2.a it is clear that the efficiency of merge sort is n log n.