added xor

Home/PL/HW/array_xor/func.c

@@ -0,0 +1,87 @@
+#include "header.h"
+
+
+void node_print(Node* n) {    
+    while (n != NULL) {
+        printf("%s\n", n->name);
+        n = n->next;
+    }
+}
+
+Node* add_tail(Node* n, char s[]) {
+    if (n == NULL) {
+        if ((n = malloc(sizeof(Node))) == NULL) {
+            printf("could not malloc\n");
+            exit(1);
+        }
+        n->next = NULL;
+        n->prev = NULL;
+        memcpy(n->name, s, LEN);
+        return n;
+    }
+    if (!strcmp(n->name, "\0")) {
+        memcpy(n->name, s, LEN);
+        n->next = NULL;
+        n->prev = NULL;
+        return n;
+    }
+
+    Node* res = n;
+    while (n->next != NULL) n = n->next;
+
+    Node* tmp = malloc(sizeof(Node));
+    memcpy(tmp->name, s, LEN);
+    tmp->prev = n;
+    n->next = tmp;
+    return res;
+}
+
+Node get(Node* node, int n) {
+    int i;
+    for (i = 0; i < n; i++) {
+        node = node->next;
+    }
+    return *node;
+}
+
+int len(Node* n) {
+    int res = 0;
+    while (n != NULL) {
+        res++;
+        n = n->next;
+    }
+    return res;
+}
+
+Node* xor_find(Node* n1, Node* n2) {
+    int i, j, f = 0;
+    Node* res = NULL;
+    if ((res = malloc(sizeof(Node))) == NULL) {
+        printf("could not malloc\n");
+        exit(3);
+    }
+
+    for (i = 0; i < len(n1); i++) {
+        for (j = 0; j < len(n2); j++) {
+            if (strcmp(get(n1, i).name, get(n2, j).name) == 0) {
+                f = 1;
+            }
+        }
+        if (f == 0)
+            res = add_tail(res, get(n1, i).name);
+        f = 0;
+    }
+
+    for (i = 0; i < len(n2); i++) {
+        for (j = 0; j < len(n1); j++) {
+            if (strcmp(get(n2, i).name, get(n1, j).name) == 0) {
+                f = 1;
+            }
+        }
+        if (f == 0)
+            res = add_tail(res, get(n2, i).name);
+        f = 0;
+    }
+
+    return res;
+}

Home/PL/HW/array_xor/gen.c

@@ -0,0 +1,46 @@
+#include "header.h"
+
+
+int main(int argc, char* argv[]) {
+    srand(time(0));
+    Node* n1 = NULL;
+    Node* n2 = NULL;
+    Node* n3 = NULL;
+    if ((n1 = malloc(sizeof(Node))) == NULL || (n2 = malloc(sizeof(Node))) == NULL || (n3 = malloc(sizeof(Node))) == NULL) {
+        printf("could not malloc\n");
+        exit(2);
+    }
+
+    int i;
+    for (i = 0; i < COUNT; i++) {
+        char s[LEN];
+        int j;
+        
+        for (j = 0; j < LEN - 1; j++) 
+            s[j] = 'a' + rand() % 2;
+        s[LEN - 1] = '\0';
+        
+        n1 = add_tail(n1, s);
+
+        for (j = 0; j < LEN - 1; j++) 
+            s[j]= 'a' + rand() % 2;
+        s[LEN - 1] = '\0';
+        n2 = add_tail(n2, s);
+    }
+
+    printf("Source arrays:\n");
+    node_print(n1);
+    printf("\n");
+    node_print(n2);
+
+    n3 = xor_find(n1, n2);
+
+    printf("\nFinal array:\n");
+    node_print(n3);
+
+    free(n1);
+    free(n2);
+    free(n3);
+
+    return 0;
+}

Home/PL/HW/array_xor/header.h

@@ -0,0 +1,19 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+#define COUNT 3
+#define LEN 3
+
+typedef struct Node {
+    char name[LEN];
+    struct Node* next;
+    struct Node* prev;
+} Node;
+
+void node_print(Node* n);
+Node* add_tail(Node* n, char s[]);
+Node get(Node* node, int n);
+Node* xor_find(Node* n1, Node* n2);
+int len(Node* n);