#include<stdlib.h>
#include<stdio.h>
 

void merge(int arr[], int l, int m, int r)
{
    int i, j, k;
    int n1 = m - l + 1;
    int n2 =  r - m;
 
   
    int L[n1], R[n2];
 
    
    for(i = 0; i < n1; i++)
        L[i] = arr[l + i];
    for(j = 0; j < n2; j++)
        R[j] = arr[m + 1+ j];
 
    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            arr[k] = L[i];
            i++;
        }
        else
        {
            arr[k] = R[j];
            j++;
        }
        k++;
    }
 
        while (i < n1)
    {
        arr[k] = L[i];
        i++;
        k++;
    }
 
    
    while (j < n2)
    {
        arr[k] = R[j];
        j++;
        k++;
    }
}
 

void mergeSort(int arr[], int l, int r)
{
    if (l < r)
    {
        int m = l+(r-l)/2; 
        mergeSort(arr, l, m);
        mergeSort(arr, m+1, r);
        merge(arr, l, m, r);
    }
}
 
 

void printArray(int A[], int size)
{
	FILE *g = fopen("algsort.out","w");
	
	if(g == NULL)
	{
		printf("Eroare");
		exit(1);
	}
    int i;
    for (i=0; i < size; i++)
        fprintf(g,"%d ", A[i]);
    fprintf(g,"\n");
}
 

int main()
{
    int arr[100],i;
    int arr_size;
	
	FILE *f = fopen("algsort.in","r");
	
	if(f == NULL)
	{
		printf("Eroare");
		exit(1);
	}
    
	fscanf(f,"%d",&arr_size);
	
	for(i=1;i<=arr_size;i++)
		fscanf(f,"%d",arr[i]);
	
   
    printArray(arr, arr_size);
 
    mergeSort(arr, 0, arr_size - 1);
 
    printf("\nSorted array is \n");
    printArray(arr, arr_size);
    return 0;
}