2. To write a C program to implement Merge
Sort using Divide and Conquer
3. • PSEUDOCODE:
• function mergesort(int low,int high)
• if low < high
• Calculate (low+high)/2 and assign it to mid
• call mergesort(low,mid);
• call mergesort(mid+1,high);
• call merge(low,mid,high);