Added Merge Sort Algo in C

merge_sort/clang/merge_sort.c

@@ -1 +1,67 @@
-//add your code here
+#include<stdio.h>
+void merge(int a[],int l,int m,int r)
+{
+	int i,j,k,n1,n2;
+	n1=m-l+1;
+	n2=r-m;
+	int L[n1],R[n2];
+	for(i=0;i<n1;i++)
+	L[i]=a[l+i];
+	for(j=0;j<n2;j++)
+	R[j]=a[m+j+1];
+	i=0;
+	j=0;
+	k=l;
+	while(i<n1 && j<n2)
+	{
+		if(L[i] <= R[j])
+		{
+			a[k]=L[i];
+			i++;
+		}
+		else
+		{
+			a[k]=R[j];
+			j++;
+		}
+		k++;
+	}
+	while(i<n1)
+	{
+		a[k]=L[i];
+		++i;
+		k++;
+	}
+	while(j<n2)
+	{
+		a[k]=R[j];
+		j++;
+		k++;
+	}
+}
+void mergeSort(int a[],int l, int r)
+{
+	if(l<r)
+	{
+		int m=(l+r)/2;
+		mergeSort(a,l,m);
+		mergeSort(a,m+1,r);
+		merge(a,l,m,r);
+	}
+}
+int main()
+{
+	int a[10],n;
+	printf("Enter the number of elements you want to enter in the array:");
+	scanf("%d",&n);
+	for(int i=0;i<n;i++)
+	{
+		printf("a[%d]:",i);
+		scanf("%d",&a[i]);
+	}
+	mergeSort(a,0,n-1);
+	printf("The sorted array is:\n");
+	for(int i=0;i<n;i++)
+	printf("%d\t",a[i]);
+	return 0;
+}