ÄÄÇ»ÅÍ ÇÁ·Î±×·¡¹Ö ¹× ½Ç½À 4¹Ý °Ô½ÃÆÇ
(http://bi.snu.ac.kr/~skim/lecture/programming)

November 21, 2001 (17:45) from 147.46.121.237
Written by ¼±ÀÌ (skim@bi.snu.ac.kr) Hits : 899 , Lines : 51
Re: ±ÞÈ÷ ¿Ã¸³´Ï´Ù. ^^
³»ÀÏ Á¦ÃâÇÒ ¿¹Á¤ÀÎ °ÍÀº ÇÁ·Î±×·¥À» ¾Ë·ÁÁà ¹ö¸®´Â °ÍÀ̶ó..¾ÈµÇ°ÚÁÒ?
±× Àü¿¡ recursiveÇÑ°Í...¹Ýº¹¹®ÀÎ °ÍÀº Çϳª Àû¾îº¼²²¿ä.
(¸®Æ÷Æ® ³½ °Í Áß¿¡¼­ Çϳª »Ì¾Ò½À´Ï´Ù)

¹®Á¦´Â ¼ö¿­À̾úÁÒ?
a(n) = 2*a(n-1) + a(n-2) + 1 (´Ü, n>=2, a(0)=1, a(1)=2)

1. non-recursive

#include<stdio.h>

int numq(int n)
{
  int a,b,c,i;
  a=1, b=2;

  for(i=2 ; i<=n ; i++) {
     c = 2*b + a + 1;
     a = b;
     b = c;
  }
  return c;
}

int main()
{
  int n;

  printf("insert number : ");
  scanf("%d",&n);
  printf("result = %d\n",numq(n));

  return 0;
}

2. recursive (mainÇÔ¼ö´Â »ý·«ÇÕ´Ï´Ù. mainÇÔ¼ö´Â 1¹ø°ú µ¿ÀÏ!)

int numq(int n)
{
  if(n==0)
     return 1;

  if(n==1)
     return 2;

  n = 2 * numq(n-1) + numq(n-2) + 1;

  return n;
}

ÀÌ»óÀÔ´Ï´ç~~ ^^

Modify Delete Post Reply Backward Forward List