Login | Register   
LinkedIn
Google+
Twitter
RSS Feed
Download our iPhone app
TODAY'S HEADLINES  |   ARTICLE ARCHIVE  |   FORUMS  |   TIP BANK
Browse DevX
Sign up for e-mail newsletters from DevX


Tip of the Day
Language: VB4,VB5,VB6,VBS
Expertise: Intermediate
May 27, 2000

GCD - The Greatest Common Divisor of two integers

' the Greatest Common Divisor of two integers
' (it uses the Euclide's algorithm)
' if either argument is zero you get a "Division by Zero" error

Function GCD(ByVal n1 As Long, ByVal n2 As Long) As Long
    Dim tmp As Long

    Do
        ' swap the items so that n1 >= n2
        If n1 < n2 Then
            tmp = n1
            n1 = n2
            n2 = tmp
        End If
        ' take the modulo
        n1 = n1 Mod n2
    Loop While n1

    GCD = n2
End Function
Francesco Balena
 
Comment and Contribute

 

 

 

 

 


(Maximum characters: 1200). You have 1200 characters left.

 

 

Sitemap
Thanks for your registration, follow us on our social networks to keep up-to-date