Trigę2

#include <iostream>

using namespace std;

bool findElement(int* arr, int arrsize, int elem){
    //int arrsize = sizeof(*arr)/sizeof(int);
    for(int i = 0; i < arrsize; i++)
        if(arr[i] == elem)
            return true;
    return false;
}

void funkcja(int* arr1, int* arr2, int arr1size, int arr2size){
    int sizeWithoutDuplicates = arr1size + arr2size;
    //liczenie duplikatow
    for(int i = 0; i < arr1size + arr2size; i++){
        for(int j = i; j < arr1size + arr2size; j++){
            int tmp1 = -1, tmp2 = -1;
            if(i >= arr1size)
                tmp1 = arr2[i-arr1size];
            else
                tmp1 = arr1[i];
            if(j >= arr1size)
                tmp1 = arr2[j-arr1size];
            else
                tmp1 = arr1[j];
            if(tmp1 == tmp2)
                sizeWithoutDuplicates--;
        }
    }
    //przerzucacie do tabeli 3
    int* arr3 = new int[sizeWithoutDuplicates];
    int arrsize = 0;
    for(int i = 0; i < arr1size; i++){
        if(!findElement(arr3, arrsize, arr1[i])){
            arr3[arrsize] = arr1[i];
            arrsize++;
        }
    }
    for(int i = 0; i < arr2size; i++){
        if(!findElement(arr3, arrsize, arr2[i])){
            arr3[arrsize] = arr2[i];
            arrsize++;
        }
    }
    cout << "Twoja stara kupa!" << endl;
}


int main(){
    int a[20] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
    int b[10] = {1,5,7,1,21,22,23,24,25,26};
    funkcja(a,b,20,10);
    return 0;
}