El siguiente es un programa simple para imprimir los primeros n números de Fibonacci .
Ejemplos:
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 Numbers
void 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 Code
int 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 Numbers
void 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 Code
int main()
{
printFibonacciNumbers(7);
return 0;
}
Java
// Java program to print
// first n Fibonacci Numbers
class 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 Numbers def 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 code printFibonacciNumbers(7) # This code is contributed by Danish Raza
C#
// C# program to print
// first n Fibonacci Numbers
using 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 Numbers
function 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 Numbers
function 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>
Producción
0 1 1 2 3 5 8
Método: usando la recursividad
C++
#include <iostream>
using namespace std;
int fibonacci_numbers(int n)
{
if(n == 0){
return 0;
}
else if(n == 1){
return 1;
}
else{
return fibonacci_numbers(n-2) + fibonacci_numbers(n-1);
}
}
int main() {
int n = 7;
for(int i = 0; i < n; i++)
{
cout << fibonacci_numbers(i) << " ";
}
return 0;
}
// This code is contributed by Rupesh Kapse
Java
/*package whatever //do not write package name here */
import java.io.*;
class GFG {
public static int fibonacci_numbers(int n)
{
if(n == 0){
return 0;
}
else if(n == 1){
return 1;
}
else{
return fibonacci_numbers(n-2) + fibonacci_numbers(n-1);
}
}
public static void main (String[] args) {
int n = 7;
for(int i = 0; i < n; i++){
System.out.print(fibonacci_numbers(i)+ " ");
}
}
}
// This code is contributed by Rupesh Kapse
Python3
# python code to print first n fibonacci numbers def fibonacci_numbers(num): if num == 0: return 0 elif num == 1: return 1 else: # printing fibonacci numbers return fibonacci_numbers(num-2)+fibonacci_numbers(num-1) n = 7 for i in range(0, n): print(fibonacci_numbers(i), end=" ") # this code is contributed by gangarajula laxmi
C#
// C# code to implement the approach
using System;
class GFG {
// Method to calculate the nth fibonacci number
public static int fibonacci_numbers(int n)
{
if(n == 0){
return 0;
}
else if(n == 1){
return 1;
}
else{
return fibonacci_numbers(n-2) + fibonacci_numbers(n-1);
}
}
// Driver Code
public static void Main (string[] args) {
int n = 7;
for(int i = 0; i < n; i++){
// Function call
Console.Write(fibonacci_numbers(i)+ " ");
}
}
}
// This code is contributed by phasing17
Javascript
<script>
// JavaScript code for the above approach
function fibonacci_numbers(n) {
if (n == 0) {
return 0;
}
else if (n == 1) {
return 1;
}
else {
return fibonacci_numbers(n - 2) + fibonacci_numbers(n - 1);
}
}
let n = 7;
for (let i = 0; i < n; i++) {
document.write(fibonacci_numbers(i) + " ");
}
// This code is contributed by Potta Lokesh
</script>
PHP
<?php
function fibonacci_numbers($num)
{
if($num == 0){
return 0;
}
elseif($num == 1){
return 1;
}
else{
return (fibonacci_numbers($num-2)+fibonacci_numbers($num-1));
}
}
$num=7;
for ($i = 0; $i < $num; $i++){
echo fibonacci_numbers($i);
echo " ";
}
// This code is contributed by laxmigangarajula03
?>
Producción
0 1 1 2 3 5 8
Complejidad de tiempo: O(n)
Espacio Auxiliar: O(1)
Si le gusta GeeksforGeeks y le gustaría contribuir, también puede escribir un artículo usando contribuya.geekforgeeks.org o envíe su artículo por correo a review-team@geeksforgeeks.org. Vea su artículo que aparece en la página principal de GeeksforGeeks y ayude a otros Geeks.
Escriba comentarios si encuentra algo incorrecto o si desea compartir más información sobre el tema tratado anteriormente.
Publicación traducida automáticamente
Artículo escrito por GeeksforGeeks-1 y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA