費氏數列 Fibonacci

遞迴方式

int fib(int n){
if (n==0)
return 0;
else
if (n==1)
return 1;
else
return (fib(n-1)+fib(n-2));
}

非遞迴

int fib(int n){
int pr,pr2,temp,i;
if (n==0)
return 0;
else if(n==1)
retun 1;
else{
pr2 = 0;
pr = 1;
for(i=2;i temp = pr + pr2;
pr2 =pr;
pr = tmep;
}
return temp;
}
}

swap for point

#include

main(void){
int x = 10,y =20;
printf("x = %d,y = %d before\n",x,y);
printf("x address is %x\n",&x);
printf("y address is %x\n",&y);
swap(&x,&y);
printf("x = %d,y = %d after\n",x,y);
}

swap(int *px, int *py){
int temp;
temp = *px;
*px = *py;
*py = temp;
}

man db

c language man for ubuntu
apt-get install man-db manpages manpages-dev

man -S 3

for Linux Programmer's Manual

man -S 3 printf