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
82
[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
96
面試面試面試,因為很重要所以要說三次!
kuoe0
2
240
應徵軟體工程師
kuoe0
0
160
面試心得分享
kuoe0
0
410
Windows 真的不好用...
kuoe0
0
280
Python @Wheel Lab
kuoe0
0
200
Introduction to VP8
kuoe0
0
240
Python @NCKU_CSIE
kuoe0
0
120
[ACM-ICPC] Tree Isomorphism
kuoe0
1
250
Other Decks in Programming
See All in Programming
iOS 26にアップデートすると実機でのHot Reloadができない?
umigishiaoi
0
140
PHP 8.4の新機能「プロパティフック」から学ぶオブジェクト指向設計とリスコフの置換原則
kentaroutakeda
2
1k
スタートアップの急成長を支えるプラットフォームエンジニアリングと組織戦略
sutochin26
1
6.7k
チームのテスト力を総合的に鍛えて品質、スピード、レジリエンスを共立させる/Testing approach that improves quality, speed, and resilience
goyoki
5
1k
AIともっと楽するE2Eテスト
myohei
8
2.9k
おやつのお供はお決まりですか?@WWDC25 Recap -Japan-\(region).swift
shingangan
0
140
A full stack side project webapp all in Kotlin (KotlinConf 2025)
dankim
0
130
dbt民主化とLLMによる開発ブースト ~ AI Readyな分析サイクルを目指して ~
yoshyum
3
1.1k
AI時代のソフトウェア開発を考える(2025/07版) / Agentic Software Engineering Findy 2025-07 Edition
twada
PRO
97
34k
TypeScriptでDXを上げろ! Hono編
yusukebe
3
650
PicoRuby on Rails
makicamel
2
140
NPOでのDevinの活用
codeforeveryone
0
870
Featured
See All Featured
Automating Front-end Workflow
addyosmani
1370
200k
How GitHub (no longer) Works
holman
314
140k
Become a Pro
speakerdeck
PRO
29
5.4k
Raft: Consensus for Rubyists
vanstee
140
7k
YesSQL, Process and Tooling at Scale
rocio
173
14k
How to train your dragon (web standard)
notwaldorf
96
6.1k
ピンチをチャンスに:未来をつくるプロダクトロードマップ #pmconf2020
aki_iinuma
126
53k
Documentation Writing (for coders)
carmenintech
72
4.9k
Creating an realtime collaboration tool: Agile Flush - .NET Oxford
marcduiker
30
2.1k
Distributed Sagas: A Protocol for Coordinating Microservices
caitiem20
331
22k
The Cost Of JavaScript in 2023
addyosmani
51
8.5k
The Illustrated Children's Guide to Kubernetes
chrisshort
48
50k
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.