merge sort seq

.gitignore

@@ -1,3 +1,3 @@
-omp-fusion-sort-seq
-omp-fusion-sort-par
+omp-merge-sort-seq
+omp-merge-sort-par
 *.o

Makefile

@@ -3,10 +3,10 @@ LDLIBS = -lrt
 CC = gcc
 SOURCES_COMMON = common.c
 SOURCES_SEQ = $(SOURCES_COMMON) d2s.c
-OUT_SEQ = omp-fusion-sort-seq
+OUT_SEQ = omp-merge-sort-seq
 OBJS_SEQ = $(SOURCES_SEQ:.c=.o)
 SOURCES_PAR = $(SOURCES_COMMON) d2p.c
-OUT_PAR = omp-fusion-sort-par
+OUT_PAR = omp-merge-sort-par
 OBJS_PAR = $(SOURCES_PAR:.c=.o)
 
 all: release

common.c

@@ -1,7 +1,8 @@
 #include "common.h"
 #include <stdio.h>
+#include <stdlib.h>
 
-struct timespec get_time()
+struct timespec get_time(void)
 {
     struct timespec start_time;
     clock_gettime(CLOCK_MONOTONIC, &start_time);
@@ -35,3 +36,68 @@ void print_time(struct timespec* ts)
   long t = (s * 1000000000) + (ms * 1000000) + (us * 1000) + ns;
   printf("%3lds %3ldms %3ldus %3ldns %12ld", s, ms, us, ns, t);
 }
+
+int* read_int_array(unsigned n)
+{
+  int* array = (int*)malloc(n * sizeof(unsigned));
+  for (unsigned i = 0; i < n; ++i) {
+    scanf("%i", &array[i]);
+  }
+  return array;
+}
+
+void read_input(int** array, unsigned* n)
+{
+  printf("Enter n: ");
+  scanf("%u", n);
+  printf("Enter %u integers: ", 2 * *n);
+  *array = read_int_array(2 * *n);
+}
+
+void print_array(int* array, unsigned n)
+{
+  for (unsigned i = 0; i < n; ++i) {
+    printf("%i ", array[i]);
+  }
+  printf("\n");
+}
+
+void merge_sort_merge_seq(int* array, unsigned l, unsigned m, unsigned h)
+{
+  unsigned i = l, j = m + 1, k = 0;
+  int tmp[h - l + 1];
+  while (i <= m && j <= h) {
+    if (array[i] <= array[j]) {
+      tmp[k++] = array[i++];
+    }
+    else {
+      tmp[k++] = array[j++];
+    }
+  }
+
+  while (i <= m) {
+    tmp[k++] = array[i++];
+  }
+  while (j <= h) {
+    tmp[k++] = array[j++];
+  }
+
+  for (--k; k != (unsigned)-1; --k) {
+    array[l + k] = tmp[k];
+  }
+}
+
+void merge_sort_sub_seq(int* array, unsigned l, unsigned h)
+{
+  if (l < h) {
+    unsigned m = (l + h) / 2;
+    merge_sort_sub_seq(array, l, m);
+    merge_sort_sub_seq(array, m + 1, h);
+    merge_sort_merge_seq(array, l, m, h);
+  }
+}
+
+void merge_sort_seq(int* array, unsigned s)
+{
+  merge_sort_sub_seq(array, 0, s - 1);
+}

common.h

@@ -4,9 +4,15 @@
 #define _POSIX_C_SOURCE 199309L
 #include <time.h>
 
-struct timespec get_time();
+struct timespec get_time(void);
 struct timespec time_diff(struct timespec* ts1, struct timespec* ts2);
 struct timespec get_duration(struct timespec* ts);
 void print_time(struct timespec* ts);
 
+int* read_int_array(unsigned n);
+void read_input(int** array, unsigned* n);
+void print_array(int* array, unsigned n);
+
+void merge_sort_seq(int* array, unsigned s);
+
 #endif

d2s.c

@@ -2,5 +2,10 @@
 
 int main(void)
 {
+  int* array;
+  unsigned n;
+  read_input(&array, &n);
+  merge_sort_seq(array, 2 * n);
+  print_array(array, 2 * n);
   return 0;
 }