

The above recurrence can be solved either using the Recurrence Tree method or the Master method. Merge Sort is a recursive algorithm and time complexity can be expressed as following recurrence relation. Time Complexity: O(N log(N)), Sorting arrays on different machines.

