$30 off During Our Annual Pro Sale. View Details »
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
『CrystalとGolangの速さを比較してみた』を考察してみた
Search
Shoma Saito
April 09, 2017
Programming
0
380
『CrystalとGolangの速さを比較してみた』を考察してみた
『CrystalとGolangの速さを比較してみた』を考察してみた
Shoma Saito
April 09, 2017
Tweet
Share
More Decks by Shoma Saito
See All by Shoma Saito
11/17 LT テトリスしゅきぴ
tantakan
0
150
10/18 LT swiftで楕円曲線郡を作る
tantakan
0
71
普段iOS書いてるつもりなのでgomobileを取り上げてみる
tantakan
0
130
WWDC2017 個人的まとめ
tantakan
0
210
CrystalとGolangの速さを比較してみた
tantakan
0
180
Other Decks in Programming
See All in Programming
SwiftUIで本格音ゲー実装してみた
hypebeans
0
480
生成AI時代を勝ち抜くエンジニア組織マネジメント
coconala_engineer
0
410
Patterns of Patterns
denyspoltorak
0
230
Python札幌 LT資料
t3tra
6
1k
「コードは上から下へ読むのが一番」と思った時に、思い出してほしい話
panda728
PRO
39
26k
AIの誤りが許されない業務システムにおいて“信頼されるAI” を目指す / building-trusted-ai-systems
yuya4
6
3.9k
実は歴史的なアップデートだと思う AWS Interconnect - multicloud
maroon1st
0
250
tparseでgo testの出力を見やすくする
utgwkk
2
270
開発に寄りそう自動テストの実現
goyoki
2
1.4k
AIコーディングエージェント(NotebookLM)
kondai24
0
220
FluorTracer / RayTracingCamp11
kugimasa
0
250
チームをチームにするEM
hitode909
0
370
Featured
See All Featured
Kristin Tynski - Automating Marketing Tasks With AI
techseoconnect
PRO
0
110
How to Think Like a Performance Engineer
csswizardry
28
2.4k
Max Prin - Stacking Signals: How International SEO Comes Together (And Falls Apart)
techseoconnect
PRO
0
48
個人開発の失敗を避けるイケてる考え方 / tips for indie hackers
panda_program
122
21k
AI Search: Where Are We & What Can We Do About It?
aleyda
0
6.7k
Measuring & Analyzing Core Web Vitals
bluesmoon
9
710
Done Done
chrislema
186
16k
Building a Scalable Design System with Sketch
lauravandoore
463
34k
B2B Lead Gen: Tactics, Traps & Triumph
marketingsoph
0
31
Claude Code のすすめ
schroneko
65
200k
Unsuck your backbone
ammeep
671
58k
Context Engineering - Making Every Token Count
addyosmani
9
540
Transcript
ͱ ͷ͞Λൺֱͯ͠ΈΔ !NBTPO
-5͋Γ͗ͯ͢ωλ͕ͳ͍ɻ
None
None
NBEFCZ ʹొ
None
ʹొ .BOBT5FDIOPMPHZ4PMVUJPO
Ͳ͏ͬͯ͞ΛൺΔ͔
ϑΟϘφονΛٻΊΔ
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον F
n+2 = F n+1 + F n F 1 = 1 F 2 = 1
࣮͢Δ
None
͖ͯͱʔ
None
͖ͯͱʔ
None
None
None
None
T T
T T
ͷํ͕ૣ͍ʂ
ͷํ͕ૣ͍ʂ
ʁ
None
Ϋι༷
None
O ( 1 + 5 2 ) (n−1)
O ( 1 + 5 2 ) (n−1)
ఆٛ௨Γ " # ϑΟϘφονΛٻΊΔΞϧΰϦζϜ O ( 1 + 5 2
) (n−1)
"
" ͜Μͳײ͡Ͱ ੵΈॏͶͯ͘
ఆٛ௨Γ ੵΈॏͶ # ϑΟϘφονΛٻΊΔΞϧΰϦζϜ O ( 1 + 5 2
) (n−1) O (n)
ఆٛ௨Γ ੵΈॏͶ # ϑΟϘφονΛٻΊΔΞϧΰϦζϜ O ( 1 + 5 2
) (n−1) O (n) ͘Ͷʁ
ఆٛ௨Γ ੵΈॏͶ # ϑΟϘφονΛٻΊΔΞϧΰϦζϜ O ( 1 + 5 2
) (n−1) O (n)
#
# ( f k+1 f k ) = ( 1
1 1 0) ( f k f k−1 )
# ( f k+1 f k ) = ( 1
1 1 0) ( f k f k−1 ) ( f k+1 f k ) = ( 1 1 1 0) k ( f 1 f 0 )
# ( f k+1 f k ) = ( 1
1 1 0) ( f k f k−1 ) ( f k+1 f k ) = ( 1 1 1 0) k ( f 1 f 0 ) ( f k+1 f k ) = ( 1 1 1 0) k ( 1 0)
# ( 1 1 1 0) k
# ( 1 1 1 0) k ͜Εߴʹܭࢉग़དྷΔΑͶ
# ( 1 1 1 0) k = ( 1
0 0 1) (k = 0) ( 1 0 0 1) k 2 2 (k is even) ( 1 0 0 1) ( 1 0 0 1) k−1 (k is odd)
# ( 1 1 1 0) k = ( 1
0 0 1) (k = 0) ( 1 0 0 1) k 2 2 (k is even) ( 1 0 0 1) ( 1 0 0 1) k−1 (k is odd)
ఆٛ௨Γ ੵΈॏͶ ߦྻ ϑΟϘφονΛٻΊΔΞϧΰϦζϜ O ( 1 + 5 2
) (n−1) O (n)
ఆٛ௨Γ ੵΈॏͶ ߦྻ ϑΟϘφονΛٻΊΔΞϧΰϦζϜ O ( 1 + 5 2
) (n−1) O (n) O (log n)
ఆٛ௨Γ ੵΈॏͶ ߦྻ ϑΟϘφονΛٻΊΔΞϧΰϦζϜ O ( 1 + 5 2
) (n−1) O (n) O (log n) O (log n)
͍ݴޠͰ Φʔμʔߟ͑Α͏Ͷ