write a Java program to store first 8 Fibonacci numbers in an array
Answers
Answered by
1
Explanation:
Fibonacci Series in Java without using recursion
class FibonacciExample1{
public static void main(String args[])
{
int n1=0,n2=1,n3,i,count=10;
System.out.print(n1+" "+n2);//printing 0 and 1.
for(i=2;i<count;++i)//loop starts from 2 because 0 and 1 are already printed.
{
n3=n1+n2;
Similar questions