Scribd Logo
Upload

Welcome to Scribd!

  • Fibonancci Iteratif: #Include #Include

    Uploaded by

    AngeLz Mike
    10 views2 pages
    This document contains code for calculating the Fibonacci sequence iteratively and recursively in C programming language. The iterative function calculates the sequence by initializing two starting values and adding them together in a for loop. The recursive function calculates individual terms by summing the previous two values, with base cases to return the first two values of 0 and 1. Both functions take an integer input n to return the nth term of the Fibonacci sequence.

    Original Description:

    coding fibonancci

    Original Title

    fibonancciiii

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains code for calculating the Fibonacci sequence iteratively and recursively in C programming language. The iterative function calculates the sequence by initializing two starting values and adding them together in a for loop. The recursive function calculates individual terms by summing the previous two values, with base cases to return the first two values of 0 and 1. Both functions take an integer input n to return the nth term of the Fibonacci sequence.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views2 pages

    Fibonancci Iteratif: #Include #Include

    Uploaded by

    AngeLz Mike
    This document contains code for calculating the Fibonacci sequence iteratively and recursively in C programming language. The iterative function calculates the sequence by initializing two starting values and adding them together in a for loop. The recursive function calculates individual terms by summing the previous two values, with base cases to return the first two values of 0 and 1. Both functions take an integer input n to return the nth term of the Fibonacci sequence.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Fibonancci Iteratif

    #include <stdio.h> #include <conio.h> int fibonancci (int n); int main () { int bil, hasil; printf("Masukkan deret fibonancci : "); scanf("%d", &bil); hasil = fibonancci(bil); getch (); return 0; } int fibonancci(int n) { int fibo1=0, fibo2=1, urutan, fibo; for(urutan=1; urutan<=n; urutan++) { fibo=fibo1+fibo2; fibo2=fibo1; fibo1=fibo; printf("urutan dari fibonancci ke %d yaitu : %d\n", urutan, fibo); } return (fibo); }

    Fungsi rekusif
    #include <stdio.h> #include <conio.h> int fibonancci (int n); int main () { int bil, hasil; printf("Masukkan urutan dari bilangan fibonancci : "); scanf("%d", &bil); hasil = fibonancci(bil); printf("urutan fibonancci ke%d yaitu : %d ",bil, hasil); getch (); return 0; } int fibonancci (int n) { if(n == 0) { return 0; } else if (n == 1) { return 1; } else { return fibonancci(n-1)+fibonancci(n-2); } }

    You might also like