title: What is the fastest way to write Fibonacci function in Scala?
body: <p>I've looked over a few implementations of Fibonacci function in Scala starting from a <a href="http://realityisimportant.blogspot.com/2008/07/scala-fibonacci-revisited-and-recursed.html" rel="noreferrer">very simple one</a>, to the <a href="http://m14i.wordpress.com/2011/05/29/scala-hello-memo-fibonacci/" rel="noreferrer">more complicated ones</a>.</p>
  
  <p>I'm not entirely sure which one is the fastest. I'm leaning towards the impression that the ones that uses memoization is faster, however I wonder why Scala doesn't have a native memoization. </p>
  
  <p>Can anyone enlighten me toward the best and fastest (and cleanest) way to write a fibonacci function?</p>