Question

I need help implementing these functions in c++. One finds the intersection of two SortedType lists, and the other finds the union.

SortedType Intersection(SortedType & list1, SortedType & list2);

SortedType Union(SortedType & list1, SortedType & list2);

Any help is appreciated

Answer 1

Here is the solution to the above question. The explanation is done in the code itself in the form of comments (see image) for better line by line explanation and better understanding.

Also the code is complete. Copy and past the code and replace "SortedType" with the type of list you want and pass it to these function.

Code:

SortedType Intersection(SortedType & list1, SortedType & list2){ // function to print intersaction
   cout<<"Printing Intersaction: ";
   int l1=list1.size();                // getting the length of the list1.
   int l2=list2.size();                // getting the length of the list2.
   for(int i=0;i<l1;i++){                //loop for the index number of list1
       for(int i=0;i<l2;i++){            // loop for the index number of the list2
           if(list1[j]==list2[i]){    // checking the condition for the same character
               cout<<list2[i]<<" ";    //if the character is same then print it.
           }
       }
   }
   cout<<"\n";
}

SortedType Union(SortedType & list1, SortedType & list2){ // function to print union.
   cout<<"Printing Union: ";
   int m=list1.size();                // getting the length of the list1
    int n=list1.size();                // getting the length of the list2
   int i=0,j=0;
   while(i<m&&j<n)                    // loop to check the condition till the last index of both the list
   {
    if(list1[i]<list2[j])                // condition to chcek if the list1 element is lessthen list2
       cout<<list1[i++]<<" ";
    else if(list2[j]<list1[i])            // condition to chcek if the list2 element is lessthen list1
       cout<<list2[j++]<<" ";
    else
    {
       cout<<list2[j++]<<" ";
       i++;
    }}
   while(i<m)                         // printing the remaining element if exist. In case of the list are not of same size.
       cout<<list1[i++]<<" ";

   while(j< n)                        // printing the remaining element if exist. In case of the list are not of same size.
       cout<<list2[j++]<< " ";
}

Note: If you are still unable to understand, then comment with it and I will be happy to help.