Scribd Logo
Upload

Welcome to Scribd!

  • Fibonacci

    Uploaded by

    aixcendana
    10 views2 pages
    This flowchart and pseudocode describe a Fibonacci sequence program. It initializes variables n1 to 0, n2 to 1, and t to 0. It then accepts a user input for x. If x is 1, it prints n1, if x is 0 it prints nothing. Otherwise, it iterates from i=3 to x, calculating t as the sum of n1 and n2 on each iteration and updating n1 and n2 for the next. Finally, it prints the result t.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This flowchart and pseudocode describe a Fibonacci sequence program. It initializes variables n1 to 0, n2 to 1, and t to 0. It then accepts a user input for x. If x is 1, it prints n1, if x is 0 it prints nothing. Otherwise, it iterates from i=3 to x, calculating t as the sum of n1 and n2 on each iteration and updating n1 and n2 for the next. Finally, it prints the result t.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views2 pages

    Fibonacci

    Uploaded by

    aixcendana
    This flowchart and pseudocode describe a Fibonacci sequence program. It initializes variables n1 to 0, n2 to 1, and t to 0. It then accepts a user input for x. If x is 1, it prints n1, if x is 0 it prints nothing. Otherwise, it iterates from i=3 to x, calculating t as the sum of n1 and n2 on each iteration and updating n1 and n2 for the next. Finally, it prints the result t.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Flowchart:

    t

    y

    y



    t


























    start
    n1=0,n2=1,t=0
    ;4*a*c
    x==1
    x==0
    for (i=3;i<=x;i++)
    t=0;
    t=t+(n1+n2);
    n1=n2;
    n2=t;
    print n1
    print t
    stop
    Input x

    Pseudocode:
    Deklarasi
    x ,n1,n2,t: int
    Proses:
    n1=0,n2=1,t=0;
    input x
    if (x==1)
    print n1;
    else if(x==0)
    printf \n;
    else
    printf n1,n2;
    for (i=3;i<=x;i++)
    t=0;
    t=t+(n1+n2);
    n1=n2;
    n2=t;
    print t;
    end




    trace:
    Input : x = 6

    Proses: D = (5*5) (4*1*6) = 1
    x
    1
    = (- 5 + sqrt (1)) / 2*1 = - 2
    x
    2
    = (- 5 sqrt(1)) / 2*1 = - 3

    Output : 0 1 1 2 3 5

    You might also like