Question

Question 10 15 pts In this question, you are asked to implement a recursive function that checks whether two increasingly sorted arrays of integers are disjoint or not (two arrays are disjoint iff they share no common elements). Your function needs to follow the following signature: int is Disjoint (int" sorted 1, int size 1, int* sorted 2, int size2) Here is the description of the input and output parameters of is Disjoint: • int" sorted 1: pointer to the beginning of the first sorted array • int size 1: size of the first sorted array • int" sorted 2: pointer to the beginning of the second sorted array • int size2: size of the second sorted array • output is zero if arrays sorted 1 and sorted2 have no intersection and is one otherwise. To implement this function, you may use the following function that performs a binary search through an increasingly sorted array of integers and checks whether the input integer key exists in the given array.

Answer 1

CODE IN C++ :

#include<iostream>
using namespace std;
int binarysearch(int key, int* array, int size) // given in the question
{
int low = 0, high = size-1;
while(low < high)
{
if(array[(low+high)/2] == key)
return 1;
else if(array[(low+high)/2] > key)
high = (low+high)/2;
else
low = (low+high)/2 + 1;
}
return 0;
}
int isDisjoint(int* sorted1, int size1, int* sorted2, int size2)
{
for(int i = 0; i < size1; i++)
{
if(binarysearch(sorted1[i], sorted2, size2) == 1) // searching for every element of sorted1 in sorted2 until we get any common
{
return 1;
}
}
return 0;
}

OUTPUT SNIPPET

Case 1 : Disjoint

int main()
{
int array1[5] = {2,4,6,8,10};
int array2[5] = {1,3,5,7,9};
if(isDisjoint(array1,5,array2,5) == 0)
{
cout << "The arrays are disjoint" << endl;
}
else
{
cout << "The arrays are not disjoint" << endl;
}
}

The arrays are disjoint Process returned 0 (0x0) Press any key to continue. execution time : 9.085 s

Case 2 : Not disjoint

int main()
{
int array1[5] = {2,4,6,8,10};
int array2[5] = {1,3,6,7,9};
if(isDisjoint(array1,5,array2,5) == 0)
{
cout << "The arrays are disjoint" << endl;
}
else
{
cout << "The arrays are not disjoint" << endl;
}
}

The arrays are not disjoint Process returned (ØxO) execution time : 0.078 s Press any key to continue.