Frage im Vorstellungsgespräch bei HERE Technologies

Write a recursive and iterative algorithm for the fibonacci sequence

Antwort im Vorstellungsgespräch

Anonym

5. Juli 2016

package com.interview.praax; public class Fibonacci { private static int limit = 10; private static int counter = 1; public static void main(String[] args) { System.out.print("Rec: "+1); counter++; recursive(0, 1); counter=1; System.out.println(); System.out.print("Iter : "+1); counter++; iterative(0, 1); } private static void iterative(int prec, int result) { while(counter<=limit) { int disp = prec+result; System.out.print(","+disp); prec = result; result = disp; counter++; //recursive(prec, result); } } private static void recursive(int prec, int result) { if(counter<=limit) { int disp = prec+result; System.out.print(","+disp); prec = result; result = disp; counter++; recursive(prec, result); }; } }