Add Sorting Algorithms in C language.

algorithms/sorting/Bubble_Sort.c

@@ -0,0 +1,32 @@
+
+#include <stdio.h>
+
+void bubble_sort(int array[],int len){
+    int i,j,temp;
+    for(i=0; i<len-1;i++){
+        for(j=0;j<len-i-1;j++){
+            if(array[j]>array[j+1]){
+                temp=array[j];
+                array[j]=array[j+1];
+                array[j+1]=temp;
+            }
+        }
+    }
+}
+
+void main(){
+    int l;
+    printf("Enter Number of Element in Array: ");
+    scanf("%d",&l);
+    int array[l],i;
+    for(i=0;i<l;i++){
+        printf("Enter %d Element: ",i+1);
+        scanf("%d",&array[i]);
+    }
+
+    bubble_sort(array,l);
+    printf("The Sorted Array is: ");
+    for(i=0;i<l;i++){
+        printf("%d ",array[i]);
+    }
+}

algorithms/sorting/Counting_Sort.c

@@ -0,0 +1,51 @@
+// Counting sort in C programming
+
+#include <stdio.h>
+
+void counting_sort(int array[], int size) {
+  int output[10];
+
+  int max = array[0];
+  for (int i = 1; i < size; i++) {
+    if (array[i] > max)
+      max = array[i];
+  }
+
+  int count[10];
+
+  for (int i = 0; i <= max; ++i) {
+    count[i] = 0;
+  }
+
+  for (int i = 0; i < size; i++) {
+    count[array[i]]++;
+  }
+
+  for (int i = 1; i <= max; i++) {
+    count[i] += count[i - 1];
+  }
+  for (int i = size - 1; i >= 0; i--) {
+    output[count[array[i]] - 1] = array[i];
+    count[array[i]]--;
+  }
+  for (int i = 0; i < size; i++) {
+    array[i] = output[i];
+  }
+}
+
+void main(){
+    int l;
+    printf("Enter Number of Element in Array: ");
+    scanf("%d",&l);
+    int array[l],i;
+    for(i=0;i<l;i++){
+        printf("Enter %d Element: ",i+1);
+        scanf("%d",&array[i]);
+    }
+
+    counting_sort(array,l);
+    printf("The Sorted Array is: ");
+    for(i=0;i<l;i++){
+        printf("%d ",array[i]);
+    }
+}

algorithms/sorting/Insertion_Sort.c

@@ -0,0 +1,34 @@
+
+
+#include <stdio.h>
+
+void insertion_sort(int array[],int l){
+    int i,j,key;
+    for(i=1;i<l;i++){
+        key=array[i];
+        j=i-1;
+        while(j>=0 && array[j]>key){
+            array[j+1]=array[j];
+            j=j-1;
+        }
+        array[j+1]=key;
+
+    }
+}
+
+void main(){
+    int l;
+    printf("Enter Number of Element in Array: ");
+    scanf("%d",&l);
+    int array[l],i;
+    for(i=0;i<l;i++){
+        printf("Enter %d Element: ",i+1);
+        scanf("%d",&array[i]);
+    }
+
+    insertion_sort(array,l);
+    printf("The Sorted Array is: ");
+    for(i=0;i<l;i++){
+        printf("%d ",array[i]);
+    }
+}

algorithms/sorting/Merge_Sort.c

@@ -0,0 +1,68 @@
+#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 merge_sort(int array[], int l, int r)
+{
+	if (l < r) {
+		int m = l + (r - l) / 2;
+        merge_sort(array, l, m);
+		merge_sort(array, m + 1, r);
+		merge(array, l, m, r);
+	}
+}
+
+
+void main(){
+    int l;
+    printf("Enter Number of Element in Array: ");
+    scanf("%d",&l);
+    int array[l],i;
+    for(i=0;i<l;i++){
+        printf("Enter %d Element: ",i+1);
+        scanf("%d",&array[i]);
+    }
+
+    merge_sort(array,0,l);
+    printf("The Sorted Array is: ");
+    for(i=0;i<l;i++){
+        printf("%d ",array[i]);
+    }
+}

algorithms/sorting/Quick_Sort.c

@@ -0,0 +1,49 @@
+
+#include <stdio.h>
+
+void swap(int *a, int *b) {
+  int t = *a;
+  *a = *b;
+  *b = t;
+}
+
+int partition(int array[], int low, int high) {
+
+  int pivot = array[high];
+
+  int i = (low - 1);
+  for (int j = low; j < high; j++) {
+    if (array[j] <= pivot) {
+      i++;
+      swap(&array[i], &array[j]);
+    }
+  }
+  swap(&array[i + 1], &array[high]);
+
+  return (i + 1);
+}
+
+void quick_sort(int array[], int low, int high) {
+  if (low < high) {
+    int pi = partition(array, low, high);
+    quick_sort(array, low, pi - 1);
+    quick_sort(array, pi + 1, high);
+  }
+}
+
+void main(){
+    int l;
+    printf("Enter Number of Element in Array: ");
+    scanf("%d",&l);
+    int array[l],i;
+    for(i=0;i<l;i++){
+        printf("Enter %d Element: ",i+1);
+        scanf("%d",&array[i]);
+    }
+
+    quick_sort(array,0,l);
+    printf("The Sorted Array is: ");
+    for(i=0;i<l;i++){
+        printf("%d ",array[i]);
+    }
+}

algorithms/sorting/Selection_Sort.c

@@ -0,0 +1,38 @@
+#include <stdio.h>
+
+
+void selection_sort(int array[], int n)
+{
+    int i, j, min, t;
+
+    for (i = 0; i < n-1; i++)
+    { 
+        min = i;
+        for (j = i+1; j < n; j++)
+          if (array[j] < array[min]){
+            min = j;}
+           if(min != i){
+                t=array[min];
+                array[min]=array[i];
+                array[i]=t;
+           }
+    }
+}
+
+
+void main(){
+    int l;
+    printf("Enter Number of Element in Array: ");
+    scanf("%d",&l);
+    int array[l],i;
+    for(i=0;i<l;i++){
+        printf("Enter %d Element: ",i+1);
+        scanf("%d",&array[i]);
+    }
+
+    selection_sort(array,l);
+    printf("The Sorted Array is: ");
+    for(i=0;i<l;i++){
+        printf("%d ",array[i]);
+    }
+}