Count number of elements that increase or decrease by a factor of 10 with recursion

Question

#include 

using namespace std;
int factorsOf10(int arr[], int value)
{
    int count = 0;
    int len = sizeof(arr) / sizeof(0);
    for (int i = 0;