ÇÏ·ç¿¡ ÂÉ°µ´Ù C++ ¾Ë°í¸®Áò (recursion ÇٽɱâÃÊ)
¢º ¡®ÇÏ·ç¿¡ ÂÉ°µ´Ù XXX¡¯ ½Ã¸®Áî¿¡ ´ëÇÏ¿© :
¡®ÇÏ·ç¿¡ ÂÉ°µ´Ù XXX¡¯ ½Ã¸®Áî´Â Æ÷½ºÆ® Äڷγª,
´º³ë¸Ö ½Ã´ëÀÇ ¿ì¸® ¸ðµÎ¸¦ À§ÇØ ±âȹÇÏ¿´½À´Ï´Ù.
¡®ÇÏ·ç¿¡ ÂÉ°µ´Ù XXX¡¯ ½Ã¸®Áî´Â
ºÎ´ã ¾øÀÌ ¸·°£À» È°¿ëÇÏ¿© ÇÙ½É Áö½ÄÀ» ì±â´Â
¸ðµç ºÐ¾ß¸¦ ¸Á¶óÇÑ
ÀÚ°¡¹ßÀü ±³¾ç/ÇнÀ ½Ã¸®ÁîÀÔ´Ï´Ù.
¡®ÇÏ·ç¿¡ ÂÉ°µ´Ù XXX¡¯ ½Ã¸®Áî´Â
ÄÞÆÑÆ®ÇÑ Æ÷¸Ë, ÆíÇÏ°Ô Á¢±Ù °¡´ÉÇÑ °¡¼ººñ ³ôÀº,
Àü±¹¹Î ¹®°í ½Ã¸®ÁîÀÔ´Ï´Ù.
¢º ÃâÆÇ»ç ¼Æò
¡®ÇÏ·ç¿¡ ÂÉ°µ´Ù C++ ¾Ë°í¸®Áò¡¯ (recursion ÇٽɱâÃÊ)Àº
C++ ÇÁ·Î±×·¡¹Ö ¾ð¾î·Î ±¸ÇöÇÏ´Â ¾Ë°í¸®Áò ÇÁ·Î±×·¡¹Ö ¹æ¹ýÀ»
½±°Ô ¼³¸íÇÑ ÇнÀ¼ÀÔ´Ï´Ù.
¢º Ã¥ÀÇ Æ¯Â¡
ÃÊ/Áß/°í ±×¸®°í ´ëÇлý±îÁö C++ ÇÁ·Î±×·¡¹Ö ¾ð¾î¸¦ ÇнÀÇÏ°í
Á»´õ ¾ÕÀ¸·Î ³ª¾Æ°¡°í ½ÍÀº ÃʽÉÀÚ¸¦ À§ÇØ
¼Ò½ºÄڵ带 Á÷Á¢ ÄÚµùÇÏ¸é¼ ¹®Á¦ÇØ°á¿¡ »ç¿ëµÇ´Â
ÀÚ·á ±¸Á¶¿Í ¾Ë°í¸®Áò ÇÁ·Î±×·¡¹Ö ¹æ¹ýÀ»
ÇнÀÇÒ ¼ö ÀÖµµ·Ï ¸¸µé¾ú½À´Ï´Ù.
ÃÊ/Áß/°íµîÇлýÀº Á¤º¸¿Ã¸²ÇÇ¾Æµå ±âÃâ¹®Á¦³ª
°¢Á¾ ¾Ë°í¸®Áò ÇÁ·Î±×·¡¹Ö ´ëȸ¹®Á¦¸¦
recursive functionÀ¸·Î ¸¸µé¾î¼
Ç®¾îº¸´Â °Íµµ ÁÁÀº ÇнÀ¹æ¹ýÀÔ´Ï´Ù.
¢º ¸ñÂ÷ :
Warm Up. ¾Ë°í¸®Áò ÇÁ·Î±×·¡¹ÖÀÇ ±âÃÊÁö½Ä
a) mathematical induction
b) recurrence relation
c) Fibonacci sequence
d) tree structure
e) binary tree
f) Fibonacci tree
g) C++ function
1st Split. recursionÀÇ ÇٽɱâÃÊ
01. recursion
02. iteration vs recursion
03. recursion°ú ¾Ë°í¸®Áò
04. recursive function
05. call stack
06. Fibonacci function
07. call stack - fibo
08. Coding Drill - finite sum
09. recursion for output ? descending
10. recursion for output ? ascending
2nd Split. recursionÀÇ È°¿ë
11. euclid's algorithm
12. decimal to binary converter
13. palindrome
14. tower of hanoi
15. Coding Drill ? °è´Ü 1, 2
16. Coding Drill ? °è´Ü 1, 2, 3