Schrijf het Fibonacci-algoritme op.

Question

anom · Accepted Answer

In Perl

use strict;
use bigint;

my ($a, $b) = (0, 1);
for (1..12) {
        print "$a
";
        ($a, $b) = ($b, $a+$b);
}

Manu · Answer

Here is a function: (uses iteration. Not recursion)


long fibo(int n) {
 if(n<=0) {
         cerr<<"Invalid input";
         return -1;
 }  
 else {
        long a=0, b=1, c;
        for(int i=1; i

Tabrej · Answer

Solution in Java:

Using recursion:

for(int i=1; i<=number; i++){
            System.out.print(fibonaci(i) +" ");
}

public static int fibonaci(int num){
         
        if(num==1 || num ==2){
            return 1;
        }
        
        return fibonaci(num-1)+fibonaci(num-2);
    }

Using for loop:
int fibCount = 10;
         int[] fib = new int[fibCount];
         fib[0] = 1;
         fib[1] = 1;
         for(int i=2; i < fibCount; i++){
             fib[i] = fib[i-1] + fib[i-2];
         }
 
         for(int i=0; i< febCount; i++){
                 System.out.print(feb[i] + " ");
         }

Booking.com

Pregunta de entrevista de Booking.com

Respuestas de entrevistas

Empresas seguidas

Búsquedas de empleo