Question

C++ Thinking recursively - No loops , i solved the first one i need help with the others

int factR(int n)
{    // Find the factorial of a number
   if (n == 0) return 1;
   return n * factR(n - 1);
   return 0;
}

2) //   Linear Search

int searchR(const int data[], int first, int last, int lookFor)
{
   return 0;
}

3)

int binarySearchR(const int data[], int first, int last, int lookFor)
{

    return 0;
}

int raiseToPowerR(int base, int exponent)
{
   // Raise base to the power exponent
   return 0;
}
int productR(const int data[], int cellsUsed)
{
   // Find the product of integers in an array
   return 0;
}
int sumR(const int data[], int cellsUsed)
{
    // Find the sum of integers in an array
   return 0;
}

Answer 1

Solved Function:

int searchR(const int data[], int first, int last, int lookFor)
{
if(last<first)
return -1
if(data[first]==lookFor)
return first;
if(data[last]==lookFor)
return last;
return searchR(data,first+1,last-1,lookFor);
}

int binarySearchR(const int data[], int first, int last, int lookFor)
{
if(last<first)
return -1;
else{
int midElement=first+(last-1)/2;
if(data[midElement]==lookFor)
return mid;

if(data[midElement]>x)
return binarySearchR(data,1,midElement-1,lookFor);

return binarySearchR(data,midElement+1,last,lookFor);
}
}

int raiseToPowerR(int base, int exponent)
{
if(exponent!=0)
return (base*raiseToPowerR(base,exponent-1));
else   
return 1;
}

int productR(const int data[], int cellsUsed)
{
if(cellsUsed<=0)
return 1;
else
return (data[cellsUsed-1]*productR(data,cellsUsed-1));
}

int sumR(const int data[], int cellsUsed)
{
if(cellsUsed<=0)
return 0;
return (sumR(data,cellsUsed-1+data[cellsused-1]));
}

if you like the answer please provide a thumbs up.