Algorithms

   

HOMEWORK

Each student should set up a web page in which the homework is published.

Lecture 0: Pancakes.

Lecture 1: Getting started

  • Run the iterative version of Fibonacci in Java using, integer, long integer, float,double and BigInteger, and register the term n in witch you get overflow.
  • Run the iterative version of Fibonacci in Python and register the term n in witch you get overflow.
  • Run the recursive versionsof Fibonacci (Python and Java) and stablish the first n that requires more than 10 miniutes to get the answer.
       
Home