+static int sn_network_add_odd_even_merger_recursive (sn_network_t *n,
+ int *indizes, int indizes_num)
+{
+ if (indizes_num > 2)
+ {
+ sn_comparator_t c;
+ sn_stage_t *s;
+ int indizes_half_num;
+ int *indizes_half;
+ int status;
+ int i;
+
+ indizes_half_num = indizes_num / 2;
+ indizes_half = (int *) malloc (indizes_num * sizeof (int));
+ if (indizes_half == NULL)
+ return (-1);
+
+ for (i = 0; i < indizes_half_num; i++)
+ {
+ indizes_half[i] = indizes[2 * i];
+ indizes_half[indizes_half_num + i] = indizes[(2 * i) + 1];
+ }
+
+ status = sn_network_add_odd_even_merger_recursive (n,
+ indizes_half, indizes_half_num);
+ if (status != 0)
+ {
+ free (indizes_half);
+ return (status);
+ }
+
+ status = sn_network_add_odd_even_merger_recursive (n,
+ indizes_half + indizes_half_num, indizes_half_num);
+ if (status != 0)
+ {
+ free (indizes_half);
+ return (status);
+ }
+
+ free (indizes_half);
+
+ s = sn_stage_create (n->stages_num);
+ if (s == NULL)
+ return (-1);
+
+ for (i = 1; i < (indizes_num - 2); i += 2)
+ {
+ c.min = indizes[i];
+ c.max = indizes[i + 1];
+
+ sn_stage_comparator_add (s, &c);
+ }
+
+ sn_network_stage_add (n, s);
+ }
+ else
+ {
+ sn_comparator_t c;
+ sn_stage_t *s;
+
+ assert (indizes_num == 2);
+
+ c.min = indizes[0];
+ c.max = indizes[1];
+
+ s = sn_stage_create (n->stages_num);
+ if (s == NULL)
+ return (-1);
+
+ sn_stage_comparator_add (s, &c);
+ sn_network_stage_add (n, s);
+ }
+
+ return (0);
+} /* int sn_network_add_odd_even_merger_recursive */
+
+static int sn_network_add_odd_even_merger (sn_network_t *n)
+{
+ int *indizes;
+ int indizes_num;
+ int status;
+ int i;
+
+ indizes_num = n->inputs_num;
+ indizes = (int *) malloc (indizes_num * sizeof (int));
+ if (indizes == NULL)
+ return (-1);
+
+ for (i = 0; i < indizes_num; i++)
+ indizes[i] = i;
+
+ status = sn_network_add_odd_even_merger_recursive (n,
+ indizes, indizes_num);
+
+ free (indizes);
+ return (status);
+} /* int sn_network_add_bitonic_merger */
+