Respuesta :
Answer:
The code in Java that computes the Fibonacci sequence is given below:
class Main {
public static void main(String[] args) {
long a = 0;
long b = 1;
long c;
long n = 12;
System.out.print(b+" ");
for(int i = 2; i <= n;i++){
c = a + b;
a = b;
b = c;
System.out.print(c+" ");
}
}
}
Explanation:
In this section I explain the code:
class Main {
public static void main(String[] args) {
long a = 0; //Seed value for the serie k-1
long b = 1; //Seed value for the serie k-2
long c; //Seed value for the serie k
long n = 12; // Represent the digits you want of the sequence
System.out.print(b+" "); //Print the first digit of the sequence k-2
for(int i = 2; i <= n;i++){
c = a + b; //Refresh the current value
a = b; //Update the value of k-1
b = c; //Update the value of k-2
System.out.print(c+" "); //Print the current value of the sequence
}
}
}
Answer:
// C++ program to print first 12 term of Fibonacci Series
#include <iostream>
using namespace std;
// main function
int main()
{
// variables
int n=12, f = 1, s = 1, nt = 0;
cout << "First 12 term of Fibonacci Series: ";
// print 12 terms
for (int a = 1; a<= n; a++)
{
// Prints the first two terms.
if(a <=2 )
{
cout << 1<<" ";
}
else
{
// update the next term
nt = f + s;
f = s;
s = nt;
// print the next term
cout << nt << " ";
}
}
return 0;
}
Explanation:
Declare and initialize n=12,f=1,s=1 and nt=0.Run a loop for 12 times, for first term print 1 and then next term will be calculated as sum of last two term of Series. Then update the first and second term.This will continue for 12 time and print the terms of Fibonacci Series.
Output:
First 12 term of Fibonacci Series: 1 1 2 3 5 8 13 21 34 55 89 144
