Scribd Logo
Upload

Welcome to Scribd!

  • Algoritm CMMDC

    Uploaded by

    Antonio Dumitru
    8 views2 pages
    The document presents two algorithms for calculating the greatest common divisor (GCD) of two integers a and b. The first algorithm (V1) iteratively calculates the remainder r of a divided by b and updates a and b until b is 0. It then returns a as the GCD. The second algorithm (V2) iteratively subtracts the larger of a and b from the other until they are equal, at which point their value is returned as the GCD. An example is shown for each algorithm calculating the GCD of 36 and 24, correctly returning 12 both times.

    Original Description:

    Original Title

    algoritm CMMDC

    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
    The document presents two algorithms for calculating the greatest common divisor (GCD) of two integers a and b. The first algorithm (V1) iteratively calculates the remainder r of a divided by b and updates a and b until b is 0. It then returns a as the GCD. The second algorithm (V2) iteratively subtracts the larger of a and b from the other until they are equal, at which point their value is returned as the GCD. An example is shown for each algorithm calculating the GCD of 36 and 24, correctly returning 12 both times.

    Copyright:

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

    Algoritm CMMDC

    Uploaded by

    Antonio Dumitru
    The document presents two algorithms for calculating the greatest common divisor (GCD) of two integers a and b. The first algorithm (V1) iteratively calculates the remainder r of a divided by b and updates a and b until b is 0. It then returns a as the GCD. The second algorithm (V2) iteratively subtracts the larger of a and b from the other until they are equal, at which point their value is returned as the GCD. An example is shown for each algorithm calculating the GCD of 36 and 24, correctly returning 12 both times.

    Copyright:

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

    V1 V2

    intreg a, b, r; Intreg a, b;
    Inceput Inceput
    Citeste a; Citeste a;
    Citeste b; Citeste b;
    Cat timp b<>0 executa Cat timp a<>b executa
    R a mod b; Daca a>b
    A b; Atunci a a-b;
    B r; Altfel b b-a;
    Sfarsit cat timp Sfarsit daca
    Scrie “cmmdc=”, a; Sfarsit cat timp;
    Sfarsit. Scrie “cmmdc=”,a;
    Sfarsit.
    ex 1: a36, b24 ex:1 a86; b48
    intreg a,b,r; intreg a, b;
    inceput inceput
    a36; a86;
    b24; b48;
    cat timp 24<>0 (A) executa cat timp 86<>48 (A) executa
    r36 mod 24; daca 86>48 (A)
    a24; atunci a86-48;
    b12; cat timp 38<>48 (A) executa
    cat timp 12<> 0 (A) executa daca 38>48 (F)
    r12 mod 12; altfel b48-38;
    a12; cat timp 38<>10 (A) executa
    b0; daca 38>10 (A)
    cat timp 0<>0 (F) atunci a38-10;
    sfarsit cat timp; cat timp 28<>10 (A) executa
    cmmdc=12; daca 28>10 (A)
    sfarsit. atunci a28-10;
    cat timp 18<>10 (A) executa
    daca 18>10 (A)
    atunci a18-10;
    cat timp 8<>10 (A) executa
    daca 8>10 (F)
    altfel b10-8;
    cat timp8<>2 (A) executa
    daca 8>2 (A)
    atunci a8-2;
    cat timp 6<>2 (A) executa
    daca 6>2 (A)
    atunci a6-2;
    cat timp 4<>2 (A) executa
    daca 4>2 (A)
    atunci a4-2;
    cat timp 2<> 2 (F)
    structura se incheie;
    cmmdc=2;
    sfarsit;
    ex 1: a36; b24
    intreg a,b;
    inceput
    a36;
    b24;
    cat timp 36<>24 (A) executa
    daca 36>24 (A)
    atunci a36-24;
    cat timp 12<>24 (A) executa
    daca 8>24 (F)
    altfel b24-12;
    cat timp 12<>12 (F)
    structura se incheie;
    cmmdc=12;
    sfarsit;

    You might also like