Initial data commit

Task/Sorting-algorithms-Counting-sort/C/sorting-algorithms-counting-sort-1.c

@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void counting_sort_mm(int *array, int n, int min, int max)
+{
+  int i, j, z;
+
+  int range = max - min + 1;
+  int *count = malloc(range * sizeof(*array));
+
+  for(i = 0; i < range; i++) count[i] = 0;
+  for(i = 0; i < n; i++) count[ array[i] - min ]++;
+
+  for(i = min, z = 0; i <= max; i++) {
+    for(j = 0; j < count[i - min]; j++) {
+      array[z++] = i;
+    }
+  }
+
+  free(count);
+}
+
+void min_max(int *array, int n, int *min, int *max)
+{
+  int i;
+
+  *min = *max = array[0];
+  for(i=1; i < n; i++) {
+    if ( array[i] < *min ) {
+      *min = array[i];
+    } else if ( array[i] > *max ) {
+      *max = array[i];
+    }
+  }
+}

Task/Sorting-algorithms-Counting-sort/C/sorting-algorithms-counting-sort-2.c

@@ -0,0 +1,11 @@
+#define N 100
+#define MAX_AGE 140
+int main()
+{
+  int ages[N], i;
+
+  for(i=0; i < N; i++) ages[i] = rand()%MAX_AGE;
+  counting_sort_mm(ages, N, 0, MAX_AGE);
+  for(i=0; i < N; i++) printf("%d\n", ages[i]);
+  return EXIT_SUCCESS;
+}