Merge sort using recursion.c

Merge sort using recursion.c

@@ -0,0 +1,92 @@
+/*  C Program to implement Merge Sort using Recursion  */
+
+#include <stdio.h>
+
+void mergeSort(int [], int, int, int);
+void partition(int [],int, int);
+
+int main()
+{
+    int list[50];
+    int i, size;
+
+    printf("How Many elements u want to Sort :: ");
+    scanf("%d", &size);
+
+    printf("\nEnter [ %d ] elements below to be Sorted :: \n",size);
+
+    for(i = 0; i < size; i++)
+    {
+        printf("\nEnter [ %d ] Element :: ",i+1);
+         scanf("%d", &list[i]);
+    }
+
+    partition(list, 0, size - 1);
+
+    printf("\n\nAfter implementing Merge sort, Sorted List is :: \n\n");
+    for(i = 0;i < size; i++)
+    {
+         printf("%d   ",list[i]);
+    }
+
+    printf("\n");
+
+   return 0;
+}
+
+void partition(int list[],int low,int high)
+{
+    int mid;
+
+    if(low < high)
+    {
+        mid = (low + high) / 2;
+        partition(list, low, mid);
+        partition(list, mid + 1, high);
+        mergeSort(list, low, mid, high);
+    }
+}
+
+void mergeSort(int list[],int low,int mid,int high)
+{
+    int i, mi, k, lo, temp[50];
+
+    lo = low;
+    i = low;
+    mi = mid + 1;
+    while ((lo <= mid) && (mi <= high))
+    {
+        if (list[lo] <= list[mi])
+        {
+            temp[i] = list[lo];
+            lo++;
+        }
+        else
+        {
+            temp[i] = list[mi];
+            mi++;
+        }
+        i++;
+    }
+    if (lo > mid)
+    {
+        for (k = mi; k <= high; k++)
+        {
+            temp[i] = list[k];
+            i++;
+        }
+    }
+    else
+    {
+        for (k = lo; k <= mid; k++)
+        {
+             temp[i] = list[k];
+             i++;
+        }
+    }
+
+    for (k = low; k <= high; k++)
+    {
+        list[k] = temp[k];
+    }
+}