3.14之递归

递归练习

1. 递归和非递归分别实现求第n个斐波那契数。

递归

#include<stdio.h>

int fib(int n)
{
    if(n < 3) return 1;
    return fib(n-1) + fib(n-2);
}

int main(){
    int n = 0;
    printf("Please input a number: ");
    scanf("%d", &n);
    printf("%d\n", fib(n));
    return 0;
}

非递归

#include<stdio.h>

int fib(int n)
{
    int a = 1;
    int b = 1;
    int c = 2;
    int count = 0;
    if(n > 2)
    {
        while( count < n-2)
        {
            c = a + b;
            a = b;
            b = c;
            count++;
        }
        return c;       
    }
    return 1;
}

int main(){
    int n = 0;
    printf("Please input a number: ");
    scanf("%d", &n);
    printf("%d\n", fib(n)); 
    return 0;
}

2. 编写一个函数实现n^k，使用递归实现

#include<stdio.h>

int my_power(int n, int k)
{
    if(k == 0) return 1;
    if(k == 1) return n;
    return (n * my_power(n, k-1));
}

int main(){
    int n = 0, k = 0;
    printf("Please input the values of n and k: ");
    scanf("%d%d", &n, &k);
    printf("The value of n^k is %d\n", my_power(n, k));

    return 0;
}

3. 写一个递归函数DigitSum(n)，输入一个非负整数，返回组成它的数字之和，例如，调用DigitSum(1729)，则应该返回1+7+2+9，它的和是19

#include<stdio.h>

int DigitSum(int n)
{
    if(n<10) return n;
    return n%10 + DigitSum(n/10);
}

int main(){
    int n = 0;
    printf("Please input a number: ");
    scanf("%d", &n);
    printf("%d", DigitSum(n));
    return 0;
}

4. 编写一个函数reverse_string(char * string)（递归实现） 实现：将参数字符串中的字符反向排列。 要求：不能使用C函数库中的字符串操作函数。

#include<stdio.h>

char *reverse_string(char * string)
{
    char *head = string;
    char ch;
    int n = 0;
    while(*(head+n) != '\0') n++; 

    if(n>1)
    {
        ch = *head;
        *head = *(head+n-1);
        *(head+n-1) = '\0';
        reverse_string(string+1);
        *(head+n-1) = ch;
    }
    return string;
}

int main(){
    char a[] = "abcdefgh";
    printf("%s\n", reverse_string(a));
    return 0;
}

5. 递归和非递归分别实现strlen

递归

#include<stdio.h>
int my_strlen(char * a)
{
    if(*(a+1) == '\0') return 1;
    return (1 + my_strlen(a+1));
}
int main(){
    char a[255];
    printf("Please input a string: ");
    scanf("%s", a);
    printf("It's length is %d\n", my_strlen(a));
    return 0;
}

非递归

#include<stdio.h>

int my_strlen(char *a)
{
    char *p = a;
    while(*p !='\0') p++;
    return p-a;
}

int main(){
    char a[255];
    printf("Please input a string: ");
    scanf("%s", a);
    printf("It's length is %d\n", my_strlen(a));
    return 0;
}

6.递归和非递归分别实现求n的阶乘

递归

#include<stdio.h>

int my_factorial(int n)
{
    if(n == 1) return 1;
    return  n * my_factorial(n-1);
}

int main(){
    int n;
    scanf("%d", &n);
    printf("%d",my_factorial(n));
    return 0;
}

非递归

#include<stdio.h> 

int my_factorial(int n)
{
    int i = 1;
    int result = 1;
    while(i<=n)
    {
        result *= i;
        i++;
    }
    return result;S
}

int main(){ 
    int n;
    scanf("%d", &n);
    printf("%d",my_factorial(n));
    return 0;
}

7. 递归方式实现打印一个整数的每一位

#include<stdio.h>

void my_printf(int n)
{
    if(n<10)
    {
        printf("%d  ", n);
        return;
    }   
    my_printf(n/10);
    printf("%d  ", n%10);

}

int main(){
    int n = 0;
    printf("Please input a number for n: ");
    scanf("%d", &n);
    my_printf(n);
    return 0;
}