Question

Requirements: You must use pointers to process all arrays.

Code a C function that accepts pointers to two arrays of integers and their respective sizes. This function should check and count how many matchings entries in both arrays and return the count back to main for display. (important! Matchings entries do not have to be located in the same position and you are required to assume that the two arrays are of different sizes…also assume no duplicate within either arrays)

Answer 1

#include<stdio.h>
int count(int a[],int b[],int alen,int blen)
{
   int i,j,match=0;
   for(i=0;i<alen;i++)
   {
       for(j=0;j<blen;j++)
       {
           if(a[i]==b[j])
           {
               match++;
           }
       }
   }
   return match;
}
int main()
{
   int a[]={1,5,56,3,4};
   int b[]={4,3,7,5,8,10};
   printf("matches=%d\n",count(a,b,5,6));

}

Explanation:

This program will take O(n²) complexity,because we are checking each element of first array with each element of second array.

If any match entries is occured it counts the match.And at last it will return total count of the match entries in both arrays.

Here passing pointers to the function means passing the addresses,for arrays the name of the array points first element in the array,that is why we pass array name a and b are passed to the function count(a,b,5,6)