Jun 16, 2020

1 min read

Haskell: Fibonacci in O(n) time

Inspired by: https://www.youtube.com/watch?v=_JtPhF8MshA&t=13m12s

Use https://repl.it/languages/haskell to run the code.\

A mind-blowing version I’ve seen:

fibs = Data.Function.fix $ (0:) . scanl (+) 1
fib = (fibs !!)

--

More from Jacob Tan En

Maths, stats, econs / software, functional programming _ https://github.com/2jacobtan

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Nathan Magyar

5 Ways to Write Semantic, Accessible HTML5

Michael Chen

in

Attenchen to Detail

Kubernetes Tutorial with Example

Ben Fraser

Arduino NRF24L01+ Communications

PingCAP

TiDB, the Key to a Better Life for Meituan-Dianping’s 290 Million Monthly Users

Monitoring Architecture

Banana Chip Tech

in

Python in Plain English

Dealing With Input and Output in Python

sudesh goyat

Remove node module from git

Leon Zucchini

in

Curiosity

Intelligent Search for Customer Service Teams

Customer service employees working at computers

Brett Blandford

Thruster Visuals: GDJ 24

About Help Terms Privacy

Get the Medium app

Jacob Tan En

Jacob Tan En

Maths, stats, econs / software, functional programming _ https://github.com/2jacobtan

More from Medium

Aditya Vaste

Different Types Of Constructor In C++

Gajendra Gulgulia

C++20 jthread and stop token: a gentle introduction

codeaxen

Upload images to the Server with ionic 5

Mario Arias

Comparing implementations of the Monkey language IV: Here comes a new challenger: Crystal

Help
Status
Writers
Blog
Careers
Privacy
Terms
About
Knowable