Scribd Logo
Upload

Welcome to Scribd!

  • Fibocci

    Uploaded by

    Oussama Eljaafari
    15 views1 page
    The document describes initializing a sequence in memory with the first two elements (0 and 1) and then using a loop to calculate each subsequent element as the sum of the previous two, storing each result in the next memory location. It sets the index register SI to point to the start of the sequence, loads the first two elements, initializes a counter CX for the length of the sequence, then enters a loop that adds the current and previous elements, increments SI, and stores the sum, repeating CX times until the full sequence is generated.

    Original Description:

    Original Title

    fibocci.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes initializing a sequence in memory with the first two elements (0 and 1) and then using a loop to calculate each subsequent element as the sum of the previous two, storing each result in the next memory location. It sets the index register SI to point to the start of the sequence, loads the first two elements, initializes a counter CX for the length of the sequence, then enters a loop that adds the current and previous elements, increments SI, and stores the sum, repeating CX times until the full sequence is generated.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views1 page

    Fibocci

    Uploaded by

    Oussama Eljaafari
    The document describes initializing a sequence in memory with the first two elements (0 and 1) and then using a loop to calculate each subsequent element as the sum of the previous two, storing each result in the next memory location. It sets the index register SI to point to the start of the sequence, loads the first two elements, initializes a counter CX for the length of the sequence, then enters a loop that adds the current and previous elements, increments SI, and stores the sum, repeating CX times until the full sequence is generated.

    Copyright:

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

    MOV AL, 00H: AL now has the 1st number from the sequence

    MOV SI, 500H: Making the SI point to the output location


    MOV [SI], AL: Moving 0 into the first position
    ADD SI, 1: Increment SI to point to the next memory location
    ADD AL, 1: Now, AL has the 2nd element of the sequence
    MOV [SI], AL: Moving 01H into the 2nd position
    MOV CX, [0000H]: Moving the value stored at offset 0 into CX(counter)
    SUB CX, 02H: Since we have initialised the first 2 elements of the sequence, we
    need to decrement the counter by 2
    L1: This defines the start of the loop (A label is created)
    MOV AL, [SI-1]: Moves the element in the (i-1)th position into AL
    ADD AL, [SI]: Moves the (i)th element with the (i-1)th element already present in
    AL
    ADD SI, 1: Increment SI to point to the next position
    MOV [SI], AL: Store the sum in the new position
    LOOP L1: The instructions between label L1 and this LOOP instruction are executed
    “CX” times
    HLT: Ends the program

    You might also like