diff --git a/sorting/comb_sort.c b/sorting/comb_sort.c
new file mode 100644
index 00000000..e76898eb
--- /dev/null
+++ b/sorting/comb_sort.c
@@ -0,0 +1,46 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define SHRINK 1.3	//suggested shrink factor value
+
+void sort (int *numbers, int size) 
+{
+	int gap = size;
+	while (gap > 1) 	//gap = 1 means that the array is sorted 
+	{
+		gap = gap/SHRINK;
+		int i = 0;
+		while ((i + gap) < size) 
+		{	//similiar to the Shell Sort
+			if (numbers[i] > numbers[i + gap])
+			{
+				int tmp = numbers[i];
+				numbers[i] = numbers[i + gap];
+				numbers[i + gap] = tmp;
+			}
+			i++;
+		}
+	}
+}
+
+void display(int *array, int n)
+{
+    for (int i = 0; i < n; ++i)
+        printf("%d ", array[i]);
+    printf("\n");
+}
+
+int main()
+{
+	int size = 6;
+	int *numbers = malloc(size*sizeof(int));
+	printf("Insert %d unsorted numbers: \n", size);
+	for (int i = 0; i < size; ++i)
+		scanf("%d", &numbers[i]);
+	printf("Initial array: ");
+    display(numbers, size);	
+    sort(numbers, size);
+	printf("Sorted array: ");
+    display(numbers, size);
+    free(numbers);
+	return 0;
+}