December, 2009

Posts
  • Code Monkey Have Fun

    Monadic Piles of Coconuts

    • 0 Comments
    After reading the “coconut” problem over on my friend’s blog , I thought it would be fun to solve it with a silly brute force approach. First, go read his post and then come back here. let take n = let m = n - 1 // give one to...
  • Code Monkey Have Fun

    Towers of Hanoi

    • 0 Comments
    A friend of mine is starting a pretty fun looking math blog . His first post is on Towers of Hanoi . I'm sure he'll tackle it with some slick mathematics, but my usual M.O. is to convert everything to code. I remember this "Hello Recursive World" from...
Page 1 of 1 (2 items)