Print the Fibonacci sequence. The first Fibonacci numbers are:
![]()
C++
// Simple CPP Program to print Fibonacci // sequence #include <iostream> using std::cout; void fib(int n) { int a = 0, b = 1, c; if (n >= 0) cout << a << " "; if (n >= 1) cout << b << " "; for (int i = 2; i <= n; i++) { c = a + b; cout << c << " "; a = b; b = c; } } // Driver code int main() { fib(9); return 0; } |
chevron_right
filter_none
Java
// Simple Java Program to print // Fibonacci sequence import java.io.*; class GFG { static void fib(int n) { int a = 0, b = 1, c; if (n >= 0) System.out.print( a + " "); if (n >= 1) System.out.print( b + " "); for (int i = 2; i <= n; i++) { c = a + b; System.out.print( c + " "); a = b; b = c; } } // Driver code public static void main (String[] args) { fib(9); } } // This code is contributed by anuj_67. |
chevron_right
filter_none
Python3
# Simple Python3 Program to # print Fibonacci sequence def fib(n): a = 0 b = 1 if (n >= 0): print(a, end=' ') if (n >= 1): print(b, end=' ') for i in range(2, n+1): c = a + b print(c, end=' ') a = b b = c # Driver code fib(9) # This code is contributed # by Prasad Kshirsagar |
chevron_right
filter_none
C#
// Simple C# Program to print // Fibonacci sequence using System; class GFG { static void fib(int n) { int a = 0, b = 1, c; if (n >= 0) Console.Write( a + " "); if (n >= 1) Console.Write( b + " "); for (int i = 2; i <= n; i++) { c = a + b; Console.Write( c + " "); a = b; b = c; } } // Driver code public static void Main () { fib(9); } } // This code is contributed by anuj_67. |
chevron_right
filter_none
PHP
<?php // Simple php Program to print // Fibonacci sequence function fib( $n) { $a = 0; $b = 1; $c; if ($n >= 0) echo $a , " "; if ($n >= 1) echo $b , " "; for ( $i = 2; $i <= $n; $i++) { $c = $a + $b; echo $c , " "; $a = $b; $b = $c; } } // Driver code fib(9); // This code is contributed by anuj_67. ?> |
chevron_right
filter_none
Output:
0 1 1 2 3 5 8 13 21 34
How to print using 2 variables isntead of 3 variables?
The algorithm with 2 variables is:
1. print a+b.
2. add a to b.
3. assign b – a to a.
C++
// CPP Program to print Fibonacci sequence // using 2 variables #include <iostream> using std::cout; void fib(int n) { int a = 0, b = 1; if (n >= 0) cout << a << " "; if (n >= 1) cout << b << " "; for (int i = 2; i <= n; i++) { cout << a + b << " "; b = a + b; a = b - a; } } // Driver code int main() { fib(9); return 0; } |
chevron_right
filter_none
Java
// Java Program to print // Fibonacci sequence // using 2 variables import java.io.*; class GFG { static void fib(int n) { int a = 0, b = 1; if (n >= 0) System.out.print(a + " "); if (n >= 1) System.out.print(b + " "); for (int i = 2; i <= n; i++) { System.out.print(a + b + " "); b = a + b; a = b - a; } } // Driver code public static void main (String[] args) { fib(9); } } // This code is contributed by anuj_67. |
chevron_right
filter_none
Python3
# Simple Python3 Program to # print Fibonacci sequence # using 2 variables def fib(n): a = 0 b = 1 if (n >= 0): print(a, end=' ') if (n >= 1): print(b, end=' ') for i in range(2, n+1): print(a + b, end=' ') b = a + b a = b - a # Driver code fib(9) # This code is contributed by # Prasad Kshirsagar |
chevron_right
filter_none
C#
// C# Program to print Fibonacci // sequence using 2 variables using System; class GFG { static void fib(int n) { int a = 0, b = 1; if (n >= 0) Console.Write(a + " "); if (n >= 1) Console.Write(b + " "); for (int i = 2; i <= n; i++) { Console.Write(a + b + " "); b = a + b; a = b - a; } } // Driver code public static void Main () { fib(9); } } // This code is contributed by anuj_67. |
chevron_right
filter_none
PHP
<?php // PHP Program to print Fibonacci sequence // using 2 variables function fib( $n) { $a = 0; $b = 1; if ($n >= 0) echo $a , " "; if ($n >= 1) echo $b , " "; for ($i = 2; $i <= $n; $i++) { echo $a + $b , " "; $b = $a + $b; $a = $b - $a; } } // Driver code fib(9); // This code is contributed by anuj_67 ?> |
chevron_right
filter_none
Output :
0 1 1 2 3 5 8 13 21 34
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Check if a M-th fibonacci number divides N-th fibonacci number
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Check if the n-th term is odd or even in a Fibonacci like sequence
- Check whether frequency of characters in a string makes Fibonacci Sequence
- Minimum number of elements to be replaced to make the given array a Fibonacci Sequence
- Split a Numeric String into Fibonacci Sequence
- Print first n Fibonacci Numbers using direct formula
- C++ Program to print Fibonacci Series using Class template
- C Program to print Fibonacci Series without using loop
- Program to print first n Fibonacci Numbers | Set 1
- Program to print Fibonacci Triangle
- Print Fibonacci Series in reverse order
- 3 Different ways to print Fibonacci series in Java
- Print n terms of Newman-Conway Sequence
- G-Fact 18 | Finding nth Fibonacci Number using Golden Ratio
- Find nth Fibonacci number using Golden ratio
- Generating large Fibonacci numbers using boost library
- Python | Find fibonacci series upto n using lambda
- Nth Fibonacci number using Pell's equation
- Find number of solutions of a linear equation of n variables
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

