Learn Java Java Tutoring is a resource blog on java focused mostly on beginners to learn Java in the simplest way without much effort you can access unlimited programs, interview questions, examples
Write a C program to find whether the given two arrays are disjoint set or not. We call two arrays disjoint set when they have no common elements between them. For checking this, we’ll first require the number of elements in the two arrays and the data values or elements in the two arrays as input.
Our expected output as mentioned in the problem statement is whether they are disjoint sets or not and, if they are not then, displaying the common elements between the two.
The first step is to gather all the necessary inputs. To read them at runtime in C, we can make use of a well-known predefined function called scanf().
This function reads any primitive datatype like int, float, char, long, etc., at runtime and based on the format specifier given in the code the input datatype is decided. For our given problem statement, all the inputs are of integer type hence, we use the ‘%d’ format specifier to read them.
We first read the sizes of two arrays and create the two arrays of the same size. We then iterate in loop from beginning to end of individual array and read the data values or elements of the two arrays.
printf(“\nEnter the size of array 1 : “);
scanf(“%d”,&n1);
printf(“\nEnter the size of array 2 :” );
scanf(“%d”,&n2);
int arr1[n1];
int arr2[n2],temp[n1];
printf(“\nEnter the %d elements in Array 1:\n”,n1);
for(i=0;i<n1;i++) {
scanf(“%d”,&arr1[i]);
}
printf(“\nEnter the %d elements in Array 2 :\n”,n2);
for(i=0;i<n2;i++) {
scanf(“%d”,&arr2[i]);
}
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 |
#include<stdio.h> int main() { int n1,n2,i,j,c,k=0; printf("\nEnter the size of array 1 : "); scanf("%d",&n1); printf("\nEnter the size of array 2 :" ); scanf("%d",&n2); int arr1[n1]; int arr2[n2],temp[n1]; printf("\nEnter the %d elements in Array 1:\n",n1); for(i=0;i<n1;i++) { scanf("%d",&arr1[i]); } printf("\nEnter the %d elements in Array 2 :\n",n2); for(i=0;i<n2;i++) { scanf("%d",&arr2[i]); } for(i = 0;i<n1;i++) { c=0; for(j=0;j<n2;j++) { if(arr1[i] == arr2[j]) { c=1; break; } } if(c==1) { temp[k++]=arr1[i]; } } if(k >0) { printf("\nThe arrays are not disjoint because the following elements are common in both arrays : "); for(i=0;i<k;i++) { printf(" %d ",temp[i]); } } else printf("\nThe arrays are disjoint there are no common elements in it \n"); return 0; } |
Output:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
Enter the size of array 1 : 5 Enter the size of array 2 :4 Enter the 5 elements in Array 1: 1 2 3 4 5 Enter the 4 elements in Array 2 : 5 6 7 8 The arrays are not disjoint because the following elements are common in both arrays : 5 |
Check If Arrays are Disjoint or Not In C – Using Function
In the above method, we have seen the logic to be used for the given problem statement but as we can observe, the entire code is within main method. The disadvantages that arise with this are that, the code is neither reusable and nor is it that readable.
For example, if the same logic is needed to be used somewhere else in the same code then, we will have to rewrite it all over again. Also, if some part of code is to be searched then, we’ll have to go through entire main method to find it which could be time consuming.
To get over these problems, we can make use of functions instead. Here, we can split the code based on its functionality and place it in different function blocks. This way, if some logic is to be reused then, we can directly make a function call and pass necessary parameters to it.
Apart from that, if some part of code is to be found then, we can directly go to its corresponding function block and look for it. Hence, code becomes reusable as well as readability is improved.
To implement this, we can split the code into to parts- the input/output operations and the logic.
The main method first reads all the necessary inputs using scanf() function just as above and then, makes a function call to the user-defined function (disjoint).
To this method, all the inputs are passed and this contains the logic behind determining whether the two arrays are disjoint sets or not. With the same logic as above it iterates through both the arrays and if it finds a matching element then it returns -1 to the main method. If there are no matching elements till the end then, it returns 1.
In main method, if the value returned is -1 then, the two arrays are not disjoint sets and the same is displayed on the console screen. Else, if the value returned is 1 then, the two arrays are disjoint set and the same is displayed on the console screen. This way, the main method handles the i/o operations whereas the user-defined function (disjoint) contains the logic for the problem statement.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 |
#include <stdio.h> #include <stdlib.h> int disjoint(int n1, int n2,int a1[], int a2[]) { int i,j; for(i = 0;i<n1;i++) { for(j=0;j<n2;j++) { if(a1[i] == a2[j]) return -1; } } return 1; } int main() { int n1,n2,i,result; printf("\nEnter the size of array 1 : "); scanf("%d",&n1); printf("\nEnter the size of array 2 :" ); scanf("%d",&n2); int arr1[n1]; int arr2[n2]; printf("\nEnter the %d elements in Array 1:\n",n1); for(i=0;i<n1;i++) { scanf("%d",&arr1[i]); } printf("\nEnter the %d elements in Array 2:\n",n2); for(i=0;i<n2;i++) { scanf("%d",&arr2[i]); } result = disjoint(n1,n2,arr1,arr2); if(result == -1) printf("\nThe arrays are not disjoint\n"); else printf("\nThe arrays are disjoint\n"); return 0; } |
Output:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
Enter the size of array 1 : 5 Enter the size of array 2 :4 Enter the 5 elements in Array 1: 1 2 3 4 5 Enter the 4 elements in Array 2: 5 6 7 8 The arrays are not disjoint |
