목차
1..................................................................................................................... Selection sort
2........................................................................................................... Fibonacci Sequence
2........................................................................................................... Fibonacci Sequence
본문내용
>
int main(void)
{
int s[5];
int k,i,j,tmp,min;
for (k=0; k<=4; k++)
{
printf(\"정수를 입력 하세요[%d개]?\",k);
scanf(\"%d\", &s[k]);
}
for(i=0; i<4; i++)
{
min=i;
for(j=i+1; j<5; j++)
{
if(s[min]>s[j]) min=j;
}
tmp=s[min];
s[min]=s[i];
s[i]=tmp;
}
printf(\"%d, %d, %d, %d, %d\\n \", s[0], s[1], s[2], s[3], s[4]);
return 0 ;
}
2. FIBONACCI Sequence
#include
int fib(const int);
int main()
{
for ( int i=1 ; i<=10 ; i++ )
cout << \"fib(\" << i << \") = \" << fib(i) << endl;
return 0;
}
int fib(const int n)
{
int s, s1=0, s2=1;
for ( int i=1 ; i<=n ; i++ ) {
s = s1 + s2;
s1 = s2;
s2 = s;
}
return s;
}
int main(void)
{
int s[5];
int k,i,j,tmp,min;
for (k=0; k<=4; k++)
{
printf(\"정수를 입력 하세요[%d개]?\",k);
scanf(\"%d\", &s[k]);
}
for(i=0; i<4; i++)
{
min=i;
for(j=i+1; j<5; j++)
{
if(s[min]>s[j]) min=j;
}
tmp=s[min];
s[min]=s[i];
s[i]=tmp;
}
printf(\"%d, %d, %d, %d, %d\\n \", s[0], s[1], s[2], s[3], s[4]);
return 0 ;
}
2. FIBONACCI Sequence
#include
int fib(const int);
int main()
{
for ( int i=1 ; i<=10 ; i++ )
cout << \"fib(\" << i << \") = \" << fib(i) << endl;
return 0;
}
int fib(const int n)
{
int s, s1=0, s2=1;
for ( int i=1 ; i<=n ; i++ ) {
s = s1 + s2;
s1 = s2;
s2 = s;
}
return s;
}
소개글