recentpopularlog in

ianweatherhogg : fibonacci   36

Faster Fibonacci
Most programmers are familiar with the naïve \(O(2^n)\) and the memoized \(O(n)\) algorithms for computing the nth Fibonacci number. However, with a bit of math, you can get the time…
ocaml  fibonacci  memoisation 
january 2018 by ianweatherhogg
spiking the solution — Simulating the Call Stack
Simulating the Call Stack In this post we will write some Scala helper code that allows you to evaluate non-tail recursive functions as if they were tail recursive. This is done behind the scenes...
scala  stack  simulation  recursion  fibonacci  tail  call  optimization  binary  tree  free  monad  5*  overflow 
may 2014 by ianweatherhogg
Java Infinite Streams | Informatech CR Blog
The following examples make extensive use of the new features in Java 8 to implement the concept of a stream: a classical data structure similar to a list that uses lazy evaluation. This is not exactly how they have defined the new streams API in Java 8 (you can find other articles I have written…
java  5*  lisp  processing  algebraic  data  type  stream  thunk  filter  fibonacci 
april 2013 by ianweatherhogg

Copy this bookmark:





to read