comp sci 1000 In mathematics, the Fibonacci numbers are the numbers in the follo
ID: 673075 • Letter: C
Question
comp sci 1000
In mathematics, the Fibonacci numbers are the numbers in the following sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... By definition, the first two numbers in the Fibonacci sequence are 1 and 1. The rest numbers can all be defined as the sum of their previous two numbers. For example: The 3^rd Fibonacci number is 2, which is the sum of the 1^st number and the 2^nd number. - (1 + 1=2) The 4^th Fibonacci number is 3, which is the sum of the 2^nd number and the 3^rd number. - (1 + 2 = 3) The 8^th Fibonacci number is 21, which is the sum of the 6^th number and the 7^th number. - (8 + 13 = 21) Write a program that allows user to input a number N, then display the first N Fibonacci numbers. You need to use Scanner (Chapter 2.13 of the textbook) to read user input. How many Fibonacci numbers do you want to display? 1 1 2 3 5 8 13 21 34 55 End of processing... How many Fibonacci numbers do you want to display? 1 End of processing...Explanation / Answer
package com.crunchify.tutorials;
import java.util.Scanner;
public class CrunchifyFibonacci {
@SuppressWarnings("resource")
public static void main(String args[])
{
//input to print Fibonacci series upto how many numbers
System.out.print("Enter number upto which Fibonacci series to print: ");
int number = new Scanner(System.in).nextInt();
System.out.println(" Fibonacci series upto " + number +" numbers : ");
//printing Fibonacci series upto number
for(int i=1; i<=number; i++)
{
System.out.print(fibonacciRecusion(i) +" ");
}
}
// Java program for Fibonacci number using recursion.
public static int fibonacciRecusion(int number){
if(number == 1 || number == 2){
return 1;
}
return fibonacciRecusion(number-1) + fibonacciRecusion(number -2); //tail recursion
}
// Java program for Fibonacci number using Loop.
public static int fibonacciLoop(int number){
if(number == 1 || number == 2){
return 1;
}
int fibo1=1, fibo2=1, fibonacci=1;
for(int i= 3; i<= number; i++){
fibonacci = fibo1 + fibo2; //Fibonacci number is sum of previous two Fibonacci number
fibo1 = fibo2;
fibo2 = fibonacci;
}
return fibonacci; //Fibonacci number
}
}
Output:
Enter number upto which Fibonacci series to print: 15
Fibonacci series upto 15 numbers :
1 1 2 3 5 8 13 21 34 55 89 144 233 377 610
package com.crunchify.tutorials;
import java.util.Scanner;
public class CrunchifyFibonacci {
@SuppressWarnings("resource")
public static void main(String args[])
{
//input to print Fibonacci series upto how many numbers
System.out.print("Enter number upto which Fibonacci series to print: ");
int number = new Scanner(System.in).nextInt();
System.out.println(" Fibonacci series upto " + number +" numbers : ");
//printing Fibonacci series upto number
for(int i=1; i<=number; i++)
{
System.out.print(fibonacciRecusion(i) +" ");
}
}
// Java program for Fibonacci number using recursion.
public static int fibonacciRecusion(int number){
if(number == 1 || number == 2){
return 1;
}
return fibonacciRecusion(number-1) + fibonacciRecusion(number -2); //tail recursion
}
// Java program for Fibonacci number using Loop.
public static int fibonacciLoop(int number){
if(number == 1 || number == 2){
return 1;
}
int fibo1=1, fibo2=1, fibonacci=1;
for(int i= 3; i<= number; i++){
fibonacci = fibo1 + fibo2; //Fibonacci number is sum of previous two Fibonacci number
fibo1 = fibo2;
fibo2 = fibonacci;
}
return fibonacci; //Fibonacci number
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.