用递归求一个字符串的长度
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
int my_strlen(const char *msg)
{
if (*msg == '\0')
return 0;
return 1 + my_strlen(msg + 1);
}
int main()
{
const char *msg = "abcd1234";
printf("%d\n", my_strlen(msg));
return 0;
}
接受一个整型无符号的,并将它转换成字符并且打印
例如输入1234,输出1 2 3 4
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
void printf_int(unsigned int x)
{
if (x > 9)
{
printf_int(x / 10);
}
printf("%d ", x % 10);
}
int main()
{
printf_int(1234567);
return 0;
}
递归实现斐波那契
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
int fib(int n)
{
if (n <= 2)
{
return 1;
}
return fib(n - 1) + fib(n - 2);
}
int main()
{
int m = 0;
m = fib(6);
printf("%d", m);
system("pause");
}