1、算法說明
1)        順序查找
         逐個元素找，如果有，則記錄位置，然后跳出循環；否則，查找失敗。
         代碼如下：
                  Private Sub Search(a(), ByVal Key, Index As Integer)
                        Dim i%
                        For i = LBound(a) To UBound(a)
                              If a(i) = Key Then '找到，將元素下標保存在index中并結束查找
                                       Index = i
                                       Exit Sub
                              End If
                        Next i
                        Index = -1             '若沒找到，則index值為-1
                  End Sub    
2)        二分法查找
順序查找效率低下，當數組有序排列時，可以使用二分法查找提高效率。
         算法思想：

   代碼如下：
                  Private Sub birSearch(a(), ByVal low%, ByVal high%, ByVal Key, index%)
                        Dim mid As Integer
                        If low > high Then     '沒有查找到
                              index = -1
                              Exit Sub
                        End If
                        mid = (low + high) \ 2 '取查找區間的中點
                        If Key = a(mid) Then   '查找到，返回下標
                              index = mid
                              Exit Sub
                        ElseIf Key < a(mid) Then '查找區間在上半部分
                          high = mid - 1
                     Else
                          low = mid + 1    '查找區間在下半部分
                        End If
                        Call birSearch(a, low, high, Key, index) '遞歸調用查找函數
                  End Sub
調用方法：
                  Private Sub Command1_Click()
                        Dim a(11)
                        a(1) = 5: a(2) = 13: a(3) = 19: a(4) = 21: a(5) = 37
                        a(6) = 56: a(7) = 64: a(8) = 75: a(9) = 80: a(10) = 88: a(11) = 92
                        Dim ind As Integer
                        Call birSearch(a, LBound(a), UBound(a), 21, ind)
                        Print ind
                  End Sub

希望與更多計算機等級考試的網友交流，請進入計算機等級考試論壇

更多信息請訪問：考試吧計算機等級考試欄目