Monthly Archives: December 2009

Decking the halls with fibonaccis

Posted on 14 December 2009 by Bryan St. Amour

Today I’d like to show off how awesome the Haskell language is with a few example programs. This blog is valid Literate Haskell, which means that you should be able to copy this entire text, save it with a .lhs … Continue reading →

Posted in Algorithms, Code, Math | Tagged , | 2 Comments

An example of how to solve a basic recurrence

Posted on 13 December 2009 by Bryan St. Amour

The time complexity of most recursive algorithms can be represented by a mathematical function called a recurrence. An example of such function is $latex T(n) = T(\frac{n}{2}) + 1$ As you can see, solving for some n involves solving for … Continue reading →

Posted in Algorithms, Math | Tagged , , | 1 Comment

Test Post

Posted on 5 December 2009 by Bryan St. Amour

This is only a test post. I downloaded some desktop blogging software and wanted to test it out… This post is the result of said test.

Posted in Uncategorized | Leave a comment