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
CrystalとGolangの速さを比較してみた
Search
Shoma Saito
February 12, 2017
Programming
0
160
CrystalとGolangの速さを比較してみた
CrystalとGolangの速さを比較してみた
Shoma Saito
February 12, 2017
Tweet
Share
More Decks by Shoma Saito
See All by Shoma Saito
11/17 LT テトリスしゅきぴ
tantakan
0
130
10/18 LT swiftで楕円曲線郡を作る
tantakan
0
62
普段iOS書いてるつもりなのでgomobileを取り上げてみる
tantakan
0
120
WWDC2017 個人的まとめ
tantakan
0
200
『CrystalとGolangの速さを比較してみた』を考察してみた
tantakan
0
350
Other Decks in Programming
See All in Programming
educure_カリキュラム生操作マニュアル.pdf
linew_official
0
810
Ruby Function Composition
bkuhlmann
1
330
エンターテイメント業界で利用されるAWS
demuyan
0
210
VS Code をプロダクトにどう取り込むか
onomax
1
370
スクラムガイドのスプリントレトロスペクティブを改めて読みかえしてみた / Re-reading the Sprint Retrospective Section in the Scrum Guide
mackey0225
3
430
Milestoner
bkuhlmann
1
410
大規模UIKitベースアプリへのTCAの段階的導入/gradual-adoption-of-tca-in-a-large-scale-uikit-based-app
takehilo
1
180
FigmaとPHPで作る1ミリたりとも表示崩れしない最強の帳票印刷ソリューション
ttskch
43
19k
Ruby GitHub Packages
bkuhlmann
0
630
Rethinking UI building strategies @ SFI 2024
letelete
0
270
はてなにおける CSS Modules、及び CSS Modules に足りないもの / CSS Modules in Hatena, and CSS Modules missing parts
mizdra
7
930
Netty Chicago Java User Group 2024-04-17
sullis
0
180
Featured
See All Featured
Navigating Team Friction
lara
178
13k
Typedesign – Prime Four
hannesfritz
36
2.1k
A designer walks into a library…
pauljervisheath
200
23k
A Philosophy of Restraint
colly
197
16k
Documentation Writing (for coders)
carmenintech
60
3.9k
Into the Great Unknown - MozCon
thekraken
10
990
The Power of CSS Pseudo Elements
geoffreycrofte
60
5k
Facilitating Awesome Meetings
lara
42
5.6k
Building Adaptive Systems
keathley
31
1.9k
How to Create Impact in a Changing Tech Landscape [PerfNow 2023]
tammyeverts
14
1.6k
The Psychology of Web Performance [Beyond Tellerrand 2023]
tammyeverts
6
1.5k
The Pragmatic Product Professional
lauravandoore
25
5.8k
Transcript
ͱ ͷ͞Λൺֱͯ͠ΈΔ !NBTPO
Ͳ͏ͬͯ͞ΛൺΔ͔
ϑΟϘφονΛٻΊΔ
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον
ϑΟϘφον F
n+2 = F n+1 + F n F 1 = 1 F 2 = 1
࣮͢Δ
None
͖ͯͱʔ
None
͖ͯͱʔ
࣮ߦͯ͠ΈΔ
None
None
T T
ͷํ͕ૣ͍ʂ
(PMBOHؔݺͼग़͕͍͠Β͍͠ʁ ࠶ؼΘͳ͚Εૣ͘ͳΔ͔ $SZTUBMࠓޙʹظ͍ͨ͠ʂʂ