[ACM-ICPC] Top-down & Bottom-up

Transcript

1. Top-down & Bottom-up ֲࢸݢʢKuoE0ʣ KuoE0.tw@gmail.com KuoE0.ch
2. Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) http://creativecommons.org/licenses/by-sa/3.0/ Latest update: Feb 27, 2013
3. Top-down ሡେ໰୊Խҝখ໰୊ɼ࠶ճᕧٻղɻ
4. Top-down ሡେ໰୊Խҝখ໰୊ɼ࠶ճᕧٻղɻ
5. Top-down ሡେ໰୊Խҝখ໰୊ɼ࠶ճᕧٻղɻ
6. Bottom-up ༝ቮ஌ղܾখ໰୊ɼஞ㑊ਪҠࢸେ໰୊ɻ
7. Bottom-up ༝ቮ஌ղܾখ໰୊ɼஞ㑊ਪҠࢸେ໰୊ɻ
8. Recursion қ༗ଠۃɼੋੜၷّɻၷّੜ࢛৅ɼ࢛৅ੜീ܋ɻʬқၚʭ ར༻ಉᒬతํ๏ෆᏗతࡉ෼໰୊҃ṧۙ౴Ҋɻ
9. Fibonacci Sequence fib(5)
10. Fibonacci Sequence fib(5) fib(4) fib(3)
11. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(3)
12. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(2) fib(1) fib(3)
13. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(2) fib(1) fib(0) fib(1) fib(3)
14. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(2) fib(1) fib(0) fib(1) fib(3) 1 0 1
15. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(2) fib(1) fib(0) fib(1) fib(3) 1 0 1 1 2
16. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(1) fib(2) fib(1) fib(0) fib(0) fib(1) fib(3) 1 0 1 1 2
17. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(1) fib(2) fib(1) fib(0) fib(0) fib(1) fib(3) 1 0 1 1 2 1 0 1 3
18. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(1) fib(2) fib(1) fib(0) fib(0) fib(1) fib(2) fib(3) fib(1) 1 0 1 1 2 1 0 1 3
19. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(1) fib(2) fib(1) fib(0) fib(0) fib(1) fib(1) fib(2) fib(3) fib(0) fib(1) 1 0 1 1 2 1 0 1 3
20. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(1) fib(2) fib(1) fib(0) fib(0) fib(1) fib(1) fib(2) fib(3) fib(0) fib(1) 1 0 1 1 2 1 0 1 3 1 0 1
21. Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(1) fib(2) fib(1) fib(0) fib(0) fib(1) fib(1) fib(2) fib(3) fib(0) fib(1) 1 0 1 1 2 1 0 1 3 1 0 1 1 2 5
22. int fib( int x ) { if ( x <= 0 ) return 0; if ( x == 1 ) return 1; return fib( x - 1 ) + fib( x - 2 ); } int main() { int ret = fib( 10 ); return 0; }
23. Iteration ಓੜҰɼҰੜೋɼೋੜࡾɼࡾੜᤈ෺ɻʬ࿝ࢠʭ ෆᏗతར༻ቮ஌ɼ࣋᠃తٻग़݁ՌҎṧۙ౴Ҋɻ
24. Fibonacci Sequence 0 1
25. Fibonacci Sequence 0 1 1
26. Fibonacci Sequence 0 1 1 2
27. Fibonacci Sequence 0 1 1 2 3
28. Fibonacci Sequence 0 1 1 2 3 5
29. int main() { int f0 = 0, f1 = 1, f2; for ( int i = 0; i < 10; ++i ) { f2 = f0 + f1; f0 = f1, f1 = f2; } return 0; }
30. ᬇ᫮୞ጯఱ্༗ɼຌਓጯᙛ༻᫮ᅲɻ
31. POJ 1664 - ์ᣄՌ Practice Now
32. reference •http://www.csie.ntnu.edu.tw/~u91029/ IterativeRecursive.html
33. Thank You for Your Listening.