**1.**实现求第n个斐波那契数
非递归实现
#define _CRT_SECURE_NO_WARNINGS
# include <stdio.h>
# include <stdlib.h>
int fib(int n)
{
int a = 1;
int b = 1;
int c;
int i = 0;
if (n <= 2)
return 1;
else
{
while (n > 2)
{
c = a + b;
a = b;
b = c;
n--;
}
}
//for (i = 3; i <= n; i++)
//{
//c = a + b;
//a = b;
//b = c;
//}
return c;
}
int main()
{
int n = 0;
int ret = 0;
scanf("%d", &n);
ret = fib(n);
printf("%d", ret);
system("pause");
return 0;
}
结果如下:
递归实现
#define _CRT_SECURE_NO_WARNINGS
# include <stdio.h>
# include <stdlib.h>
int fib(int n)
{
if (n <= 2)
return 1;
else
return fib(n - 1) + fib(n - 2);
}
int main()
{
int n = 0;
int ret = 0;
scanf("%d", &n);
ret = fib(n);
printf("%d", ret);
system("pause");
return 0;
}
结果如下:
2. 编写一个函数实现n^k,使用递归实现
# define _CRT_SECURE_NO_WARNINGS
# include <stdio.h>
# include <stdlib.h>
int Pow(int n, int k)
{
if (k == 0)
return 1;
else
return n * Pow(n, k - 1);
}
int main()
{
int n = 0;
int ret = 0;
int k = 0;
scanf("%d %d", &n, &k);
ret = Pow(n, k);
printf("%d\n", ret);
system("pause");
return 0;
}
结果如下:
3. 写一个递归函数DigitSum(n),输入一个非负整数,返回组成它的数字之和,例如,调用DigitSum(1729),则应该返回1+7+2+9,它的和是19。
实现如下:
# define _CRT_SECURE_NO_WARNINGS
# include <stdio.h>
# include <stdlib.h>
int DigitSum(int n)
{
if (n > 9)
return DigitSum(n / 10) + n % 10;
else
return n;
}
int main()
{
int n = 0;
int ret = 0;
scanf("%d", &n);
ret = DigitSum(n);
printf("%d\n", ret);
system("pause");
return 0;
}
结果如下:
4. 编写一个函数reverse_string(char * string)(递归实现)
实现:将参数字符串中的字符反向排列。
要求:不能使用C函数库中 的字符串操作函数。
实现如下:
# define _CRT_SECURE_NO_WARNINGS
# include <stdio.h>
# include <stdlib.h>
# include <string.h>
void reverse_string(char arr[])
{
int left = 0;
int right = strlen(arr) - 1;
while (left < right)
{
char tmp = arr[left];
arr[left] = arr[right];
arr[right] = tmp;
left++;
right--;
}
}
int main()
{
char arr[] = "abcdef";
reverse_string(arr);
printf("%s\n", arr);
system("pause");
return 0;
}
结果如下:
5. 递归和非递归分别实现strlen
实现如下:
# define _CRT_SECURE_NO_WARNINGS
# include <stdio.h>
# include <stdlib.h>
//递归
int my_strlen(char *str)
{
if ('\0' == *str)
return 0;
else
return 1 + my_strlen(str+1);
}
//非递归
//int my_strlen(char *str)
//{
// int count = 0;
// while ('\0' != *str)
// {
// count++;
// str++;
// }
// return count;
//}
int main()
{
char *p = "abcdef";
int len = my_strlen(p);
printf("%d\n", len);
system("pause");
return 0;
}
结果如下:
6. 递归实现求n的阶乘
实现如下:
# define _CRT_SECURE_NO_WARNINGS
# include <stdio.h>
# include <stdlib.h>
int fac(int n)
{
if (n <= 1)
return 1;
else
return n * fac(n - 1);
}
int main()
{
int n = 0;
int ret = 0;
scanf("%d", &n);
ret = fac(n);
printf("%d", ret);
system("pause");
return 0;
}
结果如下:
7. 递归方式实现打印一个整数的每一位
实现如下:
# define _CRT_SECURE_NO_WARNINGS
# include <stdio.h>
# include <stdlib.h>
void print(unsigned int num)
{
if (num > 9)
{
print(num / 10);
}
printf("%d\n", num % 10);
}
int main()
{
unsigned int num = 0;
scanf("%d", &num);
print(num);
system("pause");
return 0;
}
结果如下: