Write a function called matches that takes two int arrays and their respective sizes, and returns the number of consecutive values that match between the two arrays starting at index 0. Suppose the two arrays are {3, 2, 5, 6, 1, 3} and {3, 2, 5, 2, 6, 1, 3} then the function should return 3 since the consecutive matches are for values 3, 2, and 5.

Written in C++

int matches(int arr1[], int arr2[], int k) {

   int count = 0;

   int length = k;

   for(int i =0; i<length; i++)     {

       if(arr1[i] == arr2[i])         {

           count++;

       }

   }

   return count;

}

Explanation:

This line defines the function

int matches(int arr1[], int arr2[], int k) {

This line initializes count to 0

   int count = 0;

This line initializes length to k

   int length = k;

This line iterates through the array

   for(int i =0; i<length; i++)     {

The following if statement checks for matches

       if(arr1[i] == arr2[i])         {

           count++;

       }

   }

This returns the number of matches

   return count;

}

See attachment for complete program

i want to say d but i could be wrong however it is organized if that could happen..

hope it could