<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[run_out的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/run_out</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; run_out]]></copyright><item><title><![CDATA[【C语言】用递归函数实现Hermite Polynomials(厄密多项式)]]></title><link>https://blog.youkuaiyun.com/run_out/article/details/45605607</link><guid>https://blog.youkuaiyun.com/run_out/article/details/45605607</guid><author>run_out</author><pubDate>Sat, 09 May 2015 22:40:15 +0800</pubDate><description><![CDATA[#include
int main()
{
int hermite(int a,int b);
int n,x,h;
printf("please input n and x:\n");
scanf("%d",&n);
scanf("%d",&x);
h=hermite(n,x);
printf("Hn(x)=%d\n",h);
return 0;
}
int hermite(int a,int]]></description><category></category></item><item><title><![CDATA[【C语言】用递归函数实现n^k]]></title><link>https://blog.youkuaiyun.com/run_out/article/details/45605245</link><guid>https://blog.youkuaiyun.com/run_out/article/details/45605245</guid><author>run_out</author><pubDate>Sat, 09 May 2015 22:00:00 +0800</pubDate><description><![CDATA[直接或者间接地调用自身算法称为递归算法。用函数自身给出定义的函数称为递归函数，在某些问题中递归可以使算法的描述简洁而且易于理解。 在递归调用中系统为每一层的返回点、局部量等开辟了栈来存储。递归次数过多容易造成栈溢出。递归算法解题通常显得很简洁，但递归算法解题的运行效率较低。所以一般不提倡用递归算法设计程序。#include

int main()
{
int fan(int x,int y);]]></description><category></category></item><item><title><![CDATA[【C语言】球自由下落与反弹]]></title><link>https://blog.youkuaiyun.com/run_out/article/details/44986111</link><guid>https://blog.youkuaiyun.com/run_out/article/details/44986111</guid><author>run_out</author><pubDate>Fri, 10 Apr 2015 22:55:08 +0800</pubDate><description><![CDATA[一个球从100米高的自由落下，每次落地后反跳回原高度的一半，再落下，再反弹。求第
10次落地时，共经过多少米，第10次反弹多高。#include
int main()
{
	int i;
   double h,x;
	h=100;
	x=100;
	for( i=0;i<9;i++)
        h=h/2,x=2*h+x;
	printf("第十次反弹的高度：%f\n"]]></description><category></category></item><item><title><![CDATA[【C语言】猴子吃桃问题]]></title><link>https://blog.youkuaiyun.com/run_out/article/details/44985909</link><guid>https://blog.youkuaiyun.com/run_out/article/details/44985909</guid><author>run_out</author><pubDate>Fri, 10 Apr 2015 22:39:09 +0800</pubDate><description><![CDATA[猴子吃桃问题。猴子第一天摘下若干个桃子，当即吃了一半，好不过瘾，又多吃了一个。第二天早上又吃了剩下的桃子的一半，又多吃了一个。以后每天都吃了前一天剩下的一半零一个，到第10天早上想再吃的时候，就剩下一个桃子。求第一天共摘多少个桃子。#include
 int main()
 {
	  int sum,i;
	  sum=1;
	  for(i=10;i>1;i--)
	  sum=2*]]></description><category></category></item></channel></rss>