Fibonacci cerise in revers order using for loop

Hari Amara

Fibonacci cerise in revers order using for loop

2 Replies

Know the answer? Post it — somebody with the same question will find it here.

Jignesh Kumar6y ago
Hi Hari,

Please find below code and try to debug and understand code.
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] +" ");
        }
    }
Reference : https://www.geeksforgeeks.org/print-fibonacci-series-reverse-order/
Rajanikant Hawaldar6y ago
// C# Program to print Fibonacci // series in reverse order using System; class GFG { static void reverseFibonacci(int n) { int []a = new int[n]; // assigning first and second elements a[0] = 0; a[1] = 1; for (int i = 2; i < n; i++) { // storing sum in the // preceding location a[i] = a[i - 2] + a[i - 1]; } for (int i = n - 1; i >= 0; i--) { // printing array in // reverse order Console.Write(a[i] +" "); } } // Driver function public static void Main() { int n = 5; reverseFibonacci(n); } }