Finding Arrays are Disjoint or Not in C++

Understanding Disjoint Arrays

Two arrays are said to be disjoint if they have no elements in common.

We will explore three different methods to check if two arrays are disjoint in C++.

Method 1: Using Nested Loops

This method iterates through both arrays and checks for common elements.

#include <iostream>
#include <algorithm>
using namespace std;

bool areDisjoint(int arr1[], int n1, int arr2[], int n2) {
    for (int i = 0; i < n1; i++) {
        for (int j = 0; j < n2; j++) {
            if (arr1[i] == arr2[j]) {
                return false;
            }
        }
    }
    return true;
}

int main() {
    int arr1[] = {1, 2, 3, 4};
    int arr2[] = {5, 6, 7, 8};
    if (areDisjoint(arr1, 4, arr2, 4))
        cout << "Arrays are disjoint" << endl;
    else
        cout << "Arrays are not disjoint" << endl;
    return 0;
}
            
Output:
Arrays are disjoint

Method 2: Using Hashing

This method uses a hash set to check for common elements efficiently.

#include <iostream>
#include <algorithm>
#include <unordered_set>
using namespace std;

bool areDisjoint(int arr1[], int n1, int arr2[], int n2) {
    unordered_set hash;
    for (int i = 0; i < n1; i++)
        hash.insert(arr1[i]);
    for (int j = 0; j < n2; j++) {
        if (hash.find(arr2[j]) != hash.end())
            return false;
    }
    return true;
}

int main() {
    int arr1[] = {1, 2, 3, 4};
    int arr2[] = {5, 6, 7, 8};
    if (areDisjoint(arr1, 4, arr2, 4))
        cout << "Arrays are disjoint" << endl;
    else
        cout << "Arrays are not disjoint" << endl;
    return 0;
}
            
Output:
Arrays are disjoint

Method 3: Using Sorting and Binary Search

This method sorts one array and uses binary search to check for common elements.

#include <iostream>
#include <algorithm>
using namespace std;

bool binarySearch(int arr[], int size, int key) {
    return binary_search(arr, arr + size, key);
}

bool areDisjoint(int arr1[], int n1, int arr2[], int n2) {
    sort(arr1, arr1 + n1);
    for (int i = 0; i < n2; i++) {
        if (binarySearch(arr1, n1, arr2[i]))
            return false;
    }
    return true;
}

int main() {
    int arr1[] = {1, 2, 3, 4};
    int arr2[] = {5, 6, 7, 8};
    if (areDisjoint(arr1, 4, arr2, 4))
        cout << "Arrays are disjoint" << endl;
    else
        cout << "Arrays are not disjoint" << endl;
    return 0;
}
            
Output:
Arrays are disjoint
Top 100 Codes By Learn-for-free
Start Preparing Arraysform here👇

Below You will find some of the most important codes in languages like C, C++, Java, and Python. These codes are of prime importance for college semester exams and online tests.

Getting Started

Find Largest Element in an Array: C C++ Java Python

Find Smallest Element in an Array: C C++ Java Python

Find the Smallest and Largest Element in an Array: C C++ Java Python

Find Second Smallest Element in an Array: C C++ Java Python

Calculate the Sum of Elements in an Array: C C++ Java Python

Reverse an Array: C C++ Java Python

Sort First Half in Ascending Order and Second Half in Descending: C C++ Java Python

Finding the Frequency of Elements in an Array: C C++ Java Python

Counting the Number of Even and Odd Elements in an Array: C C++ Java Python

Finding Maximum Product Sub-array in a Given Array: C C++ Java Python

Finding Arrays are Disjoint or Not: C C++ Java Python

Finding Equilibrium Index of an Array: C C++ Java Python

Rotation of Elements of Array - Left and Right: C C++ Java Python

Balanced Parenthesis Problem: C C++ Java Python