Print Fibonacci Series in reverse order
Last Updated :
26 Nov, 2021
Given a number n then print n terms of fibonacci series in reverse order.
Examples:
Input : n = 5
Output : 3 2 1 1 0
Input : n = 8
Output : 13 8 5 3 2 1 1 0
Algorithm
1) Declare an array of size n.
2) Initialize a[0] and a[1] to 0 and 1 respectively.
3) Run a loop from 2 to n-1 and store
sum of a[i-2] and a[i-1] in a[i].
4) Print the array in the reverse order.
C++
#include <bits/stdc++.h>
using namespace std;
void reverseFibonacci(int n)
{
int a[n];
a[0] = 0;
a[1] = 1;
for (int i = 2; i < n; i++) {
a[i] = a[i - 2] + a[i - 1];
}
for (int i = n - 1; i >= 0; i--) {
cout << a[i] << " ";
}
}
int main()
{
int n = 5;
reverseFibonacci(n);
return 0;
}
|
Java
import java.io.*;
class GFG {
static void reverseFibonacci(int n)
{
int a[] = new int[n];
a[0] = 0;
a[1] = 1;
for (int i = 2; i < n; i++)
{
a[i] = a[i - 2] + a[i - 1];
}
for (int i = n - 1; i >= 0; i--)
{
System.out.print(a[i] +" ");
}
}
public static void main(String[] args)
{
int n = 5;
reverseFibonacci(n);
}
}
|
Python3
def reverseFibonacci(n):
a = [0] * n
a[0] = 0
a[1] = 1
for i in range(2, n):
a[i] = a[i - 2] + a[i - 1]
for i in range(n - 1, -1 , -1):
print(a[i],end=" ")
n = 5
reverseFibonacci(n)
|
C#
using System;
class GFG {
static void reverseFibonacci(int n)
{
int []a = new int[n];
a[0] = 0;
a[1] = 1;
for (int i = 2; i < n; i++)
{
a[i] = a[i - 2] + a[i - 1];
}
for (int i = n - 1; i >= 0; i--)
{
Console.Write(a[i] +" ");
}
}
public static void Main()
{
int n = 5;
reverseFibonacci(n);
}
}
|
PHP
<?php
function reverseFibonacci($n)
{
$a[0] = 0;
$a[1] = 1;
for ($i = 2; $i < $n; $i++)
{
$a[$i] = $a[$i - 2] +
$a[$i - 1];
}
for ($i = $n - 1; $i >= 0; $i--)
{
echo($a[$i] . " ");
}
}
$n = 5;
reverseFibonacci($n);
?>
|
Javascript
<script>
function reverseFibonacci(n)
{
let a = [];
a[0] = 0;
a[1] = 1;
for(let i = 2; i < n; i++)
{
a[i] = a[i - 2] + a[i - 1];
}
for(let i = n - 1; i >= 0; i--)
{
document.write(a[i] + " ");
}
}
let n = 5;
reverseFibonacci(n);
</script>
|
Output:
3 2 1 1 0
Time Complexity: O(n)
Auxiliary Space: O(n)
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...