Question

4. Write a C++ program (or Java program) w that reads two groups of numbers in which each group has random integer numbers with possible duplicates. Your program should display the common numbers without any duplicates in the ascending order. Input format: This is a sample input from a user. cik length WC tontu

Answer 1

Code:

#include <iostream>

using namespace std;

//to swap elements of array

void swap(int *xp, int *yp)

{

    int temp = *xp;

    *xp = *yp;

    *yp = temp;

}

//to sort the array

void sort(int a[], int n)

{

int i,j;

for(i = 0; i < n; i++)

{

    int min = i;

    for(j = i+1; j < n; j++ )

      if(a[j] < a[min])

        min = j;

    swap(&a[min], &a[i]);

}

}

//to check if the element already exists

bool ifExists(int a[], int el, int n)

{

for(int i = 0; i < n; i++)

    if(a[i] == el)

      return true;

return false;

}

int main()

{

int a1[100], a2[100], res[100], n1, n2, nres = 0;

//receive user input

cin >> n1;

for(int i = 0; i < n1; i++)

    cin >> a1[i];

cin >> n2;

for(int i = 0; i < n2; i++)

    cin >> a2[i];

//adding element if common and does not exist already in resultant array

for(int i = 0; i < n1; i++)

{

    for(int j = 0; j < n2; j++)

    {

      if((a1[i] == a2[j]) && (!ifExists(res, a1[i], nres)))

        res[nres++] = a1[i];

    }

}

//sorting resultant array

sort(res, nres);

cout << "resulting array is : ";

for(int i = 0; i < nres; i++)

    cout << res[i] <<" ";

return 0;

}

1 2 3 4 #include <iostream> using namespace std; //to swap elements of array void swap(int *xp, int *yp) int temp = *xp; *xp = *yp; *yp = temp; 10 11 //to sort the array void sort(int a[], int n) int i,j; for(i = 0; i<n; i++) 14 18 21 22 23 24 25 26 27 int min = i; for(j = i+1; j <n; j++) if(a[j] < a[min]) min = j; swap(&a[min], &a[i]); } } //to check if the element already exists bool ifExists(int a[], int el, int n) { for(int i = 0; i<n; i++) if(a[i] == el) return true; return false; } 29 30 31 32 33 34 int main() { int a1[100], a2[100], res[100], ni, n2, nres = 0; //receive user input cin >> n1; for(int i = 0; i < n1; i++) cin >> a1[i]; cin >> n2; for(int i = 0; i < n2; i++) cin >> a2[i]; //adding element if common and does not exist already in resultant array for(int i = 0; i < n1; i++) for(int j = 0; j < n2; j++) if((a1[i] == a2[j]) && (!ifExists(res, a1[i], nres))) res[nres++] = a1[i]; // sorting resultant array sort(res, nres); cout << "resulting array is : "; for(int i = 0; i < nres; i++) cout << res[i] <<" "; return 0; 57 }

Output:

CV. commonelement - X 20 14 resulting array is : 78 Press any key to continue ...