Time Complexity: Merge Sort is a recursive algorithm and time complexity can be expressed as following recurrence relation. T(n) = 2(n/2) + O(n)