Problem:
Merge Sort

Write a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.

Merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
create array L[0...n1], R[0...n2]
for i = 0 to n1-1
do L[i] = A[left + i]
for i = 0 to n2-1
do R[i] = A[mid + i]
L[n1] = SENTINEL
R[n2] = SENTINEL
i = 0;
j = 0;
for k = left to right-1
if L[i] <= R[j]
then A[k] = L[i]
i = i + 1
else A[k] = R[j]
j = j + 1

Merge-Sort(A, left, right){
if left+1 < right
then mid = (left + right)/2;
call Merge-Sort(A, left, mid)
call Merge-Sort(A, mid, right)
call Merge(A, left, mid, right)

Input

In the first line n is given. In the second line, n integers are given.

Output

In the first line, print the sequence S. Two consequtive elements should be separated by a space character.

In the second line, print the number of comparisons.

Constraints

n ≤ 500000

0 ≤ an element in S ≤ 109

Sample Input 1

10
8 5 9 2 6 3 7 1 10 4

Sample Output 1

1 2 3 4 5 6 7 8 9 10
34

Notes

Solution in C (judge verdict: Accepted)

#include <stdio.h>
#define MAX_DATA 500000
#define N 2000000000

void merge(int[],int,int,int);
void mergeSort(int[],int ,int);
int A[MAX_DATA],count=0;

int main()
{
  int i,n;

  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }

  mergeSort(A,0,n);

  for(i = 0; i <n-1; i++){
    printf("%d ", A[i]);
  }
  printf("%d\n%d\n",A[i],count);
  return 0;
}
void merge(int temp[],int left,int mid,int right){
  int n1, n2, i, j, k, L[MAX_DATA], R[MAX_DATA];

  n1= mid-left;
  n2=right-mid;

  for(i=0;i<n1;i++){
    L[i]=temp[left +i];
  }
  for(j=0;j<n2;j++){
    R[j]=temp[mid+j];
  }
    L[n1]=N;
    R[n2]=N;
    i=0;
    j=0;
   
  for(k=left;k<right;k++){
    count++;
    if(L[i] < R[j]){
      temp[k]=L[i];
      i=i+1;
    }
    else {
      temp[k]=R[j];
      j=j+1;
    }
  }
}
 
void mergeSort(int temp[],int left,int right){
  int mid;
  if(right > left+1){
    mid = (right + left)/2;
    mergeSort(temp, left, mid);
    mergeSort(temp, mid, right);
    merge(temp, left, mid, right);
  }
}