Scribd Logo
Upload

Welcome to Scribd!

  • Public Function GCD (Byval X As Long, Byval Y As Long) As Long

    Uploaded by

    Jorge Mousinho
    8 views1 page
    This document defines a public function called GCD that calculates the greatest common denominator of two long integer values, x and y. It first checks if either x or y are negative and makes them positive. It then checks if both values are 0, returning an error. Otherwise it sets the initial GCD value (g) to y and iterates, setting x to the remainder of y divided by x and y to g, until x is 0. It then returns g as the GCD.

    Original Description:

    Fuxograma de c++

    Original Title

    Fluxo_sample

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document defines a public function called GCD that calculates the greatest common denominator of two long integer values, x and y. It first checks if either x or y are negative and makes them positive. It then checks if both values are 0, returning an error. Otherwise it sets the initial GCD value (g) to y and iterates, setting x to the remainder of y divided by x and y to g, until x is 0. It then returns g as the GCD.

    Copyright:

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

    Public Function GCD (Byval X As Long, Byval Y As Long) As Long

    Uploaded by

    Jorge Mousinho
    This document defines a public function called GCD that calculates the greatest common denominator of two long integer values, x and y. It first checks if either x or y are negative and makes them positive. It then checks if both values are 0, returning an error. Otherwise it sets the initial GCD value (g) to y and iterates, setting x to the remainder of y divided by x and y to g, until x is 0. It then returns g as the GCD.

    Copyright:

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

    Public Function GCD(ByVal

    x As Long, ByVal y As Long)


    As Long

    The greatest common denominator (GCD) is the largest positive integer


    that divides into both numbers without a remainder.
    Examples: GCD(256,64)=64, GCD(12,8)=4, GCD(5,3)=1
    Work with absolute values (positive integers)

    x< 0 ?

    Yes

    x = -x
    No

    y< 0 ?

    Yes

    No y = -y

    Error, both
    x+ y> 0 ?
    parameters zero

    Yes No

    g=y GCD = 0

    Iterate until x = 0

    x> 0 ?

    No
    Yes
    g=x
    GCD = g x = y Mod x
    y= g

    End

    You might also like