c++ recursive function

Question

int sum5ToNRecursively(int n)（这个是要算从5到n的和，n大于5）
{
// if n is invalid, return 0
if (n < 5)
return 0;
if (n = 5)
return 5;
// check for the base case
// if it is the base case, return the base case value

else
{
return n+sum5ToNRecursively(n-1);
}
// if it is not the base case,
// call recursively

// modify the return value from the recursive call to be our answer
// return the answer

}

int countMoreThanSevensRecursively(int *array, int size)
这个是要算array中大于7的数 请问怎么用递归函数写这两个程序？感谢

Answer 1

int countMoreThanSevensRecursively(int *array, int size)
{
if (size<=0)
return 0;
else if(array[0] <=7)
{
cout<<"opt "<<array[0]<<endl;
return countMoreThanSevensRecursively(array+1,size-1);
}
else
{
cout<<"opt "<<array[0]<<endl;
return 1+countMoreThanSevensRecursively(array+1,size-1);
}
}

追问

谢谢！请问能帮我看下第一个function有没有什么问题吗~~~~~

追答

if (n = 5)

这是赋值
应该if (n == 5)