递归实现：1 + 1/2 - 1/3 + 1/4 - 1/5.......

/*    递归实现： *     *     1 + 1/2 - 1/3 + 1/4 - 1/5....... */#include<stdio.h>#include<stdlib.h>double Recursion(int n){    if(n==1)    {        return 1;    }    else if(n%2==0)    {        return Recursion(n-1)+1.0/n;        }    else     {        return Recursion(n-1)-1.0/n;    }}int main(){    int n;    printf("请输入n的值:\n");    scanf("%d",&n);    double result=Recursion(n);    printf("结果为:%lf\n",result);    return 0;}