Mergesort runs in time O(nlogn) and performs no more than nlognelement comparisons

Question No:The recurrence for merge sort is given,T(1)= cT(n)= 2T(n/2) + cn, n > 1Find it’s time complexity using Iteration method.

The recurrence for merge sort is given,T(1)= cT(n)= 2T(n/2) + cn, n > 1Find it‟s time complexity using Iteration method

ve the sequence of subarray sizes in the merges performed by both the topdown and the bottom-up mergesort algorithms, for N = 39

Run mergesort for large random arrays, and make an empirical determination of the average length of the other subarray when the first subarray exhausts, as a function of N (the sum of the two subarray sizes for a given merge).

Analysis of algorithm Q : The recurrence for merge sort is given,   T(1)= c T(n)= 2T(n/2) + cn,        n > 1 Find it‟s time complexity using Iteration method.

Quicksort is very efficient in practice and has an expected running time O (n log(n)). Why  would anyone ever use Merge Sort over Quicksort?

Create an implementation of mergesort that uses k-way merges rather than 2-way merges. Analyse your algorithm, formulate a theory about the ideal value of k, and conduct tests to support your theory.

When we apply the mergesort on a 12-element array, how many comparisons do we need for the worst case? Ans: