MOOC/CS102 Introduction of CS2
Unit 5. Recursion 中
soicem
2016. 12. 30. 20:50
(n+1)! = (n+1)n!
Divide and Conquar
-small problems are easier to solve than the original one
-solutions to small problem can easily be combined to solve original problem
Recursion
-way of describing problems
-way of designing solution(D&C)
ex) Hanoi, Palindrome, Fibonacci