Program to print first n Fibonacci Numbers | Set 1
Following is a simple program to print first n Fibonacci numbers.
Examples :
Input : n = 3 Output : 0 1 1 Input : n = 7 Output : 0 1 1 2 3 5 8
C++
// C++ program to print // first n Fibonacci numbers#include <bits/stdc++.h>using namespace std;// Function to print // first n Fibonacci Numbersvoid printFibonacciNumbers(int n){ int f1 = 0, f2 = 1, i; if (n < 1) return; cout << f1 << " "; for (i = 1; i < n; i++) { cout << f2 << " "; int next = f1 + f2; f1 = f2; f2 = next; }}// Driver Codeint main(){ printFibonacciNumbers(7); return 0;}// This code is contributed by rathbhupendra |
C
// C program to print // first n Fibonacci numbers#include <stdio.h>// Function to print // first n Fibonacci Numbersvoid printFibonacciNumbers(int n){ int f1 = 0, f2 = 1, i; if (n < 1) return; printf("%d ", f1); for (i = 1; i < n; i++) { printf("%d ", f2); int next = f1 + f2; f1 = f2; f2 = next; }}// Driver Codeint main(){ printFibonacciNumbers(7); return 0;} |
Java
// Java program to print // first n Fibonacci Numbersclass Test { // Method to print // first n Fibonacci Numbers static void printFibonacciNumbers(int n) { int f1 = 0, f2 = 1, i; if (n < 1) return; System.out.print(f1 + " "); for (i = 1; i < n; i++) { System.out.print(f2 + " "); int next = f1 + f2; f1 = f2; f2 = next; } } // Driver Code public static void main(String[] args) { printFibonacciNumbers(7); }} |
Python3
# Python program to print first n# Fibonacci numbers# Function to print first n# Fibonacci Numbersdef printFibonacciNumbers(n): f1 = 0 f2 = 1 if (n < 1): return print(f1, end=" ") for x in range(1, n): print(f2, end=" ") next = f1 + f2 f1 = f2 f2 = next# Driven codeprintFibonacciNumbers(7)# This code is contributed by Danish Raza |
C#
// C# program to print // first n Fibonacci Numbersusing System;class Test { // Method to print // first n Fibonacci Numbers static void printFibonacciNumbers(int n) { int f1 = 0, f2 = 1, i; if (n < 1) return; Console.Write(f1 + " "); for (i = 1; i < n; i++) { Console.Write(f2 + " "); int next = f1 + f2; f1 = f2; f2 = next; } } // Driver Code public static void Main() { printFibonacciNumbers(7); }}// This code is contributed by nitin mittal. |
PHP
<?php// PHP program to print first// n Fibonacci numbers// Function to print first n // Fibonacci Numbersfunction printFibonacciNumbers($n){ $f1 = 0; $f2 = 1; $i; if ($n < 1) return; echo($f1); echo(" "); for ($i = 1; $i < $n; $i++) { echo($f2); echo(" "); $next = $f1 + $f2; $f1 = $f2; $f2 = $next; }} // Driver Code printFibonacciNumbers(7); // This code is contributed by nitin mittal?> |
Javascript
<script>// Javascript program to print // first n Fibonacci numbers// Function to print // first n Fibonacci Numbersfunction printFibonacciNumbers(n){ let f1 = 0, f2 = 1, i; if (n < 1) return; document.write(f1 + " "); for (i = 1; i < n; i++) { document.write(f2 + " "); let next = f1 + f2; f1 = f2; f2 = next; }}// Driver Code printFibonacciNumbers(7); // This code is contributed by Mayank Tyagi</script> |
Output
0 1 1 2 3 5 8
Time Complexity: O(n)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geekforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
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.
