vb必考程序.docVIP

1． 判定素数过程； Private Function prime(n As Integer) As Boolean Dim i As Integer prime = False For i = 2 To Sqr(n) If n Mod i = 0 Then Exit Function Next i prime = True End Function 2． 求最大公约数过程； Private Function gcd(ByVal m As Integer, ByVal n As Integer) As Integer Dim t As Integer, r As Integer If m n Then t = m m = n n = t End If r = m Mod n Do While r 0 m = n n = r r = m Mod n Loop gcd = n End Function 3． 冒泡排序过程； Option Base 1 Private Sub sort(a() As Integer) Dim i As Integer, j As Integer, t As Integer For i = 1 To UBound(a) - 1 For j = 1 To UBound(a) - i If a(j) a(j + 1) Then t = a(j) a(j) = a(j + 1) a(j + 1) = t End If Next j Next i End Sub 4． 顺序查找过程； 其中，形参数组a为被查找的数组,形参变量key为需要查找的数,函数过程search返回查找之后的结果 Private Function search(a() As Integer, ByVal key As Integer) As Integer Dim i As Integer For i = LBound(a) To UBound(a) 从数组的第一个元素开始进行查找 If key = a(i) Then search = i 若找到，则返回其在数组中的位置 Exit Function End If Next i search = -1 若找不到,则返回-1 End Function 5． 判断回文数过程； 数学方法 Option Base 1 Private Function huiwen(ByVal n As Long) As Boolean Dim a() As Integer, k As Integer, i As Integer 利用动态数组保存每一位数字 huiwen = False Do While n 0 k = k + 1 ReDim Preserve a(k) a(k) = n Mod 10 依次将数n的每一位赋值给动态数组a n = n \ 10 Loop For i = 1 To k \ 2 If a(i) a(k - i + 1) Then Exit Function 依次比较第一位和最后一位、第二位和倒数第二位... Next i huiwen = True 若循环正常结束，说明全部比完,未出现不相等情况 End Function 6． 递归函数求阶乘； Private Function Fact(n As Integer) As Long If n = 1 Then Fact = 1 Else Fact = n * Fact(n - 1) End If End Function 7． 递归函数求Fibonacci数列； Privat