Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
[ACM-ICPC] Top-down & Bottom-up
Search
KuoE0
February 20, 2013
Programming
0
79
[ACM-ICPC] Top-down & Bottom-up
KuoE0
February 20, 2013
Tweet
Share
More Decks by KuoE0
See All by KuoE0
Protocol handler in Gecko
kuoe0
0
75
面試面試面試,因為很重要所以要說三次!
kuoe0
2
200
應徵軟體工程師
kuoe0
0
140
面試心得分享
kuoe0
0
370
Windows 真的不好用...
kuoe0
0
240
Python @Wheel Lab
kuoe0
0
160
Introduction to VP8
kuoe0
0
160
Python @NCKU_CSIE
kuoe0
0
89
[ACM-ICPC] Tree Isomorphism
kuoe0
1
190
Other Decks in Programming
See All in Programming
Direct Style Effect Systems The Print[A] ExampleA Comprehension Aid
philipschwarz
PRO
0
410
ソースコードを美しくたもつために ~コードレビューの認知限界を突破し、年間400リリースを達成する~
kotauchisunsun
1
730
Implementing Design Systems in Swift
seyfoyun
2
530
The Design of Everyday APIs - PyCon 2024
roguelynn
0
170
CQRS meets modern Java
simas
PRO
2
470
Exploring Type-Informed Lint Rules in Rust based TypeScript Linters
unvalley
3
630
FoodGram
iseruuuuu
0
230
『Railsオワコン』と言われる時代に、なぜブルーモ証券はRailsを選ぶのか
free_world21
2
480
TypeScriptでもLLMアプリケーション開発 / LLM Application In Typescript
rkaga
5
1.3k
初心者のためのRubyKaigi入門/RubyKaigi Introduction
a_matsuda
10
1.9k
戦略的DDDは重いのか? / Is strategic DDD heavy?
pictiny
3
2.1k
CDKコントリビュートの最初の壁を越えよう! -簡単issueの見つけ方-
badmintoncryer
3
420
Featured
See All Featured
[RailsConf 2023] Rails as a piece of cake
palkan
28
4.1k
A Modern Web Designer's Workflow
chriscoyier
689
190k
ReactJS: Keep Simple. Everything can be a component!
pedronauck
660
120k
Sharpening the Axe: The Primacy of Toolmaking
bcantrill
22
1.4k
The World Runs on Bad Software
bkeepers
PRO
61
6.7k
個人開発の失敗を避けるイケてる考え方 / tips for indie hackers
panda_program
67
14k
Making the Leap to Tech Lead
cromwellryan
125
8.6k
Typedesign – Prime Four
hannesfritz
36
2.1k
Design by the Numbers
sachag
274
18k
Building a Modern Day E-commerce SEO Strategy
aleyda
22
6.5k
The Cult of Friendly URLs
andyhume
74
5.7k
Put a Button on it: Removing Barriers to Going Fast.
kastner
58
3.1k
Transcript
Top-down & Bottom-up ֲࢸݢʢKuoE0ʣ
[email protected]
KuoE0.ch
Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) http://creativecommons.org/licenses/by-sa/3.0/ Latest update: Feb
27, 2013
Top-down ሡେԽҝখɼ࠶ճᕧٻղɻ
Top-down ሡେԽҝখɼ࠶ճᕧٻղɻ
Top-down ሡେԽҝখɼ࠶ճᕧٻղɻ
Bottom-up ༝ቮղܾখɼஞ㑊ਪҠࢸେɻ
Bottom-up ༝ቮղܾখɼஞ㑊ਪҠࢸେɻ
Recursion қ༗ଠۃɼੋੜၷّɻၷّੜ࢛ɼ࢛ੜീ܋ɻʬқၚʭ ར༻ಉᒬతํ๏ෆᏗతࡉ҃ṧۙҊɻ
Fibonacci Sequence fib(5)
Fibonacci Sequence fib(5) fib(4) fib(3)
Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(3)
Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(2) fib(1) fib(3)
Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(2) fib(1) fib(0) fib(1)
fib(3)
Fibonacci Sequence fib(5) fib(4) fib(3) fib(2) fib(2) fib(1) fib(0) fib(1)
fib(3) 1 0 1
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
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
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
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
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
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
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
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; }
Iteration ಓੜҰɼҰੜೋɼೋੜࡾɼࡾੜᤈɻʬࢠʭ ෆᏗతར༻ቮɼ࣋᠃తٻग़݁ՌҎṧۙҊɻ
Fibonacci Sequence 0 1
Fibonacci Sequence 0 1 1
Fibonacci Sequence 0 1 1 2
Fibonacci Sequence 0 1 1 2 3
Fibonacci Sequence 0 1 1 2 3 5
int main() { int f0 = 0, f1 = 1,
f2; for ( int i = 0; i < 10; ++i ) { f2 = f0 + f1; f0 = f1, f1 = f2; } return 0; }
ᬇጯఱ্༗ɼຌਓጯᙛ༻ᅲɻ
POJ 1664 - ์ᣄՌ Practice Now
reference •http://www.csie.ntnu.edu.tw/~u91029/ IterativeRecursive.html
Thank You for Your Listening.