diff --git a/Classic Algorithms/Sorting.c b/Classic Algorithms/Sorting.c
new file mode 100644
index 000000000..3a1b06cf1
--- /dev/null
+++ b/Classic Algorithms/Sorting.c	
@@ -0,0 +1,83 @@
+#include <stdio.h>
+#include <malloc.h>
+#include <limits.h>
+void merge(int A[], int p, int q, int r){
+	int *L, *R;
+	int i, j, k;
+	int lsize = q-p+1, rsize = r-q;
+	L=(int*)malloc(sizeof(int)*lsize+1);
+	R=(int*)malloc(sizeof(int)*rsize+1);
+	for(i=0; i<lsize; i++){
+		L[i] = A[i+p];
+	}
+	L[i] = INT_MAX;
+	for(j=0; j<rsize; j++){
+		R[j] = A[j+q+1];
+	}
+	R[j] = INT_MAX;
+	i=0;
+	j=0;
+	for(k=p;k<=r;){
+		if(L[i] <= R[j]){
+			A[k] = L[i];
+			k++;
+			i++;
+		}
+		else {
+			A[k] = R[j];
+			k++;
+			j++;
+		}
+	}
+}
+
+void mergeSort(int A[], int p, int r){
+	int q;
+	if(p<r){
+		q = (p+r)/2;
+		mergeSort(A, p, q);
+		mergeSort(A, q+1, r);
+		merge(A, p, q, r);
+	}
+}
+
+int main(){
+	int i;
+	int A[] = {13, 2, 69, 6, 1000, 32, 75, 15, 6, 29, 531};
+	int arr[] =  {13, 2, 69, 6, 1000, 32, 75, 15, 6, 29, 531};
+	printf("Original array:\n");
+	for(i=0; i<11; i++)
+		printf("%d ", A[i]);
+
+	/*Merge Sort*/
+	mergeSort(A, 0, 10);
+	printf("\n\nArrar after Merge Sort: \n");
+	for(i=0; i<11; i++)
+		printf("%d ", A[i]);
+    //////////////
+
+
+
+    /*Bubble Sort*/
+    int j, temp ;
+    printf("\n\nOriginal array:\n");
+    for ( i = 0 ; i <= 10 ; i++ )
+		printf ( "%d ", arr[i] ) ;
+	for ( i = 0 ; i <= 10 ; i++ )
+	{
+		for ( j = 0 ; j <= 10 - i ; j++ )
+		{
+			if ( arr[j] > arr[j + 1] )
+			{
+				temp = arr[j] ;
+				arr[j] = arr[j + 1] ;
+				arr[j + 1] = temp ;
+			}
+		}
+	}
+
+	printf ( "\n\nArray after Bubble sort:\n") ;
+
+	for ( i = 0 ; i <= 10 ; i++ )
+		printf ( "%d ", arr[i] ) ;
+}