Skip to main content

Blog Archive for kabutz during February 2012

We all know the standard Fibonacci recursive algorithm:   public BigInteger f(int n) {    if (n == 0) return BigInteger.ZERO;    if (n == 1) return BigInteger.ONE;    return f(n - 1).add(f(n - 2));  } Your challenge is to find the first 10 bytes and the last 10 bytes of f(1_000_000_000). That's right, fibonacci of one billion. Please post...
I like a good Java puzzle.  The trickier the better.  In this article I will tell you about a new set of puzzles by Wouter Coekaerts that will melt your Java brain. About five years ago, I was suckered into participating in a Java Black Belt competition at a Java Tech Days in London.  This was in the days before Her Royal Highness decided she had had enough South African visitors...
Welcome to the 198th issue of The Java(tm) Specialists' Newsletter sent to you from Chania in Greece. My readers in colder climates frequently get annoyed when I tell them that "life's a beach". They imagine us having constant sun here. It's not true. We do sometimes have torrential rains and cold weather. It even snows here occasionally. In fact, the delivery...