Question

13. Write a recursive function with the declaration: int count Equal (int* numbers, int n, int x) that has as parameters an array numbers with n > 0 elements, and an integer x, and returns how many times I appears in the array. 14. Write a recursive function with the declaration: double dist(double* u, double *v, int n) that gets two double precision arrays with n > 1 elements and returns the value: Vu[0] - v[0])2 + (u[1] – v[1])2 + ... + (u[n - 1] - vín – 1])2

Answer 1

#include <bits/stdc++.h>
using namespace std;
int countEqual(int *numbers , int n , int x)
{
if(n<0)
{
return 0;
}
if(*numbers==x)
return 1+ countEqual(numbers+1, n-1,x );
else
return countEqual(numbers+1, n-1,x );
}
int main()
{
int a[]={1,2,3,4,5,1,2,3,4,5,1,2,3,1,2,3};
cout<<countEqual(a,15,5);
}