#include #include int compare(const void *a, const void *b) { return(*(int*)a - *(int*)b); } int *AddSets(int *setA, int *setB) { int *setC = NULL; int MN = setA[0] + setB[0]; size_t i, j, k; setC = (int*) malloc((MN+1)*sizeof(int)); qsort(setA+1, setA[0], sizeof(int), compare); qsort(setB+1, setB[0], sizeof(int), compare); setC[0] = 0; i = j = k = 1; do{ while((i <= setA[0]) && (setA[i] < setB[j])){ setC[k++] = setA[i++]; setC[0] += 1; } if(setA[i] == setB[j]) i++; while((j <= setB[0]) && (setB[j] < setA[i])){ setC[k++] = setB[j++]; setC[0] += 1; } }while((i<=setA[0])&&(j<=setB[0])); while(i <= setA[0]){ setC[k++] = setA[i++]; setC[0] += 1; } while(j <= setB[0]){ setC[k++] = setB[j++]; setC[0] += 1; } return setC; } int main() { size_t j, M = 10, N = 15; int *setA = NULL, *setB = NULL, *setC = NULL; srand(M+N); setA = (int*) malloc((M+1)*sizeof(int)); setB = (int*) malloc((N+1)*sizeof(int)); setA[0] = M; printf("Set A[%d]:", setA[0]); for(size_t i = 1; i <= M; i++){ do{ setA[i] = 1+rand() % (N+M); j = 1; while(setA[i] != setA[j]) j++; }while(j < i); printf(" %d", setA[i]); } setB[0] = N; printf("\nSet B[%d]:", setB[0]); for(size_t i = 1; i <= N; i++){ do{ setB[i] = 1+rand()%(N+M); j = 1; while(setB[i] != setB[j]) j++; }while(j < i); printf(" %d", setB[i]); } printf("\n"); setC = AddSets(setA, setB); printf("Set C[%d]:", setC[0]); for(size_t i = 1; i <= setC[0]; i++){ printf(" %d", setC[i]); } printf("\n"); free(setA); free(setB); free(setC); return 0; }

IntSetAdd