dim i,j,k,t,insert_value
dim a()
i=0
function insert_sort()
ReDim Preserve a(i + 1) As Integer
a(i) = insert_value
For j = 0 To i - 1
For k = 1 To i
If a(j) > a(k) Then
t = a(k)
a(k) = a(j)
a(j) = t
End If
Next k
Next j
i = i + 1
end function
dim i,j,k,t,insert_value
dim a()
i=0
function insert_sort()
ReDim Preserve a(i + 1) As Integer
a(i) = insert_value
For j = 0 To i - 1
For k = 1 To i
If a(j) > a(k) Then
t = a(k)
a(k) = a(j)
a(j) = t
End If
Next k
Next j
i = i + 1
end function
运行不一定正确,但方法是肯定的