今天在複習遞迴(Recursion)時發現了關於最大公因數的解法,我把它改成VB碼提供給需要的各位, 因為前一陣子看好多人在問
Private Function GCD(ByVal Num As Long, ByVal Divisor As Long) As Long
Dim Remainder As Long
Remainder = Num Mod Divisor
If Remainder = 0 Then
GCD = Divisor
Else
GCD = GCD(Divisor, Remainder)
End If
End Function
Private Function GCD(ByVal Num As Long, ByVal Divisor As Long) As Long
Dim Remainder As Long
Remainder = Num Mod Divisor
If Remainder = 0 Then
GCD = Divisor
Else
GCD = GCD(Divisor, Remainder)
End If
End Function
請先 登入 以發表留言。