Welcome back from the holidays!

After almost a year and a half without visiting my country I was back there for over a month, good times! Now is back to reality, back to long sessions of keyboard crunching, back to Keenan's awesome classes.

This time I am taking Global Software Development, a class about remote and distributive development. We will work with people in other parts of the world developing projects assigned by the Professor. The idea is to learn how to: be a subordinate (follow instructions) and a leader (give instructions), merge different parts of a project into a final piece, use communication tools (video conference, e-mail, IM, etc.), keep up-to-date documentation and journals of our projects, and more things I don't remember right now.

For our first week, Prof. Keenan gave us a really simple program to develop: a fibonacci sequence calculator. Don't worry, things won't be that easy down the road, this was all about warming up. The only important thing to note about this assignment is not to fall into the trap of coding fibonacci as a recursive function. Why you ask? I'll let you give it a try and you tell me later. You should code fibonacci using an iterative algorithm like the following one:

     int a = 1, b = 1;

     for (int i = 3; i <= n; i++)

     {

          int c = a + b;

          a = b;

          b = c;

     }
     return b;

I hope my post was helpful! See you soon. Adios!