
Program to print the first n fibonacci numbers using function.the program must use InputStreamReader and BufferedReader.

Hi Friend,
Try the following code:
import java.io.*;
import java.util.*;
public class Fibonacci {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
System.out.print("Enter value of n: ");
String st = reader.readLine();
int num = Integer.parseInt(st);
int f1=0,f2=0,f3=1;
for(int i=1;i<=num;i++){
System.out.println(f3);
f1=f2;
f2=f3;
f3=f1+f2;
}
}
}
Thanks

*@author Ajay*
public class Fibonacci {
public void Fibo(int limit)
{
int a[]=new int[limit+1];
for(int i=0;i<limit;i++)
{
if(i==0)
{
a[0]=0;
System.out.println(a[0]);
}
if(i==1)
{
a[1]=1;
System.out.println(a[1]);
}
if(i>1)
{
a[0]=0;
a[1]=1;
a[i]=a[i-1]+a[i-2];
System.out.println(a[i]);
}
}
}
public static void main(String adsf[])
{
Fibonacci f=new Fibonacci();
f.Fibo(100);
}
}

*@author Ajay*
public class Fibonacci {
public void Fibo(int limit)
{
int a[]=new int[limit+1];
for(int i=0;i<limit;i++)
{
if(i==0)
{
a[0]=0;
System.out.println(a[0]);
}
if(i==1)
{
a[1]=1;
System.out.println(a[1]);
}
if(i>1)
{
a[0]=0;
a[1]=1;
a[i]=a[i-1]+a[i-2];
System.out.println(a[i]);
}
}
}
public static void main(String adsf[])
{
Fibonacci f=new Fibonacci();
f.Fibo(100);
}
}

/* Fibonacci Series Java Example This Fibonacci Series Java Example shows how to create and print Fibonacci Series using Java. */
public class JavaFibonacciSeriesExample {
public static void main(String[] args) {
//number of elements to generate in a series
int limit = 20;
long[] series = new long[limit];
//create first 2 series elements
series[0] = 0;
series[1] = 1;
//create the Fibonacci series and store it in an array
for(int i=2; i < limit; i++){
series[i] = series[i-1] + series[i-2];
}
//print the Fibonacci series numbers
System.out.println("Fibonacci Series upto " + limit);
for(int i=0; i< limit; i++){
System.out.print(series[i] + " ");
}
}
}
/* Output of the Fibonacci Series Java Example would be Fibonacci Series upto 20 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 */
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.