diff --git a/sorting/BeadSort.c b/sorting/BeadSort.c
new file mode 100644
index 00000000..37e5e0b7
--- /dev/null
+++ b/sorting/BeadSort.c
@@ -0,0 +1,75 @@
+//sorting of array list using bead sort
+#include <stdio.h>
+#include <stdlib.h>
+
+/*Displays the array, passed to this method*/
+void display(int arr[], int n){
+    
+    int i;
+    for(i = 0; i < n; i++){
+        printf("%d ", arr[i]);
+    }
+    
+    printf("\n");
+    
+}
+
+/*This is where the sorting of the array takes place
+ a --- Array to be sorted
+ len --- Array Size
+ */
+void bead_sort(int *a, int len)
+{
+	int i, j, max, sum;
+	unsigned char *beads;
+#	define BEAD(i, j) beads[i * max + j]
+ 
+	for (i = 1, max = a[0]; i < len; i++)
+		if (a[i] > max) max = a[i];
+ 
+	beads = calloc(1, max * len);
+ 
+	/* mark the beads */
+	for (i = 0; i < len; i++)
+		for (j = 0; j < a[i]; j++)
+			BEAD(i, j) = 1;
+ 
+	for (j = 0; j < max; j++) {
+		/* count how many beads are on each post */
+		for (sum = i = 0; i < len; i++) {
+			sum += BEAD(i, j);
+			BEAD(i, j) = 0;
+		}
+		/* mark bottom sum beads */
+		for (i = len - sum; i < len; i++) BEAD(i, j) = 1;
+	}
+ 
+	for (i = 0; i < len; i++) {
+		for (j = 0; j < max && BEAD(i, j); j++);
+		a[i] = j;
+	}
+	free(beads);
+}
+
+int main(int argc, const char * argv[]) {
+    int n;
+    printf("Enter size of array:\n");
+    scanf("%d", &n); // E.g. 8 1 2 3
+    
+    printf("Enter the elements of the array\n");
+    int i;
+    int arr[n];
+    for(i = 0; i < n; i++){
+        scanf("%d", &arr[i] );
+    }
+    
+    printf("Original array: ");
+    display(arr, n);
+    
+    bead_sort(arr, n);
+    
+    printf("Sorted array: ");
+    display(arr, n);
+    
+    return 0;
+}