vb.net数组排序 vbscript 数组( 二 )


PrintIndexAndValues(myArr)
End Sub 'Main
Public Shared Sub PrintIndexAndValues(myArr() As [String])
Dim i As Integer
For i = 0 To myArr.Length - 1
Console.WriteLine("[{0}] : {1}", i, myArr(i))
Next i
Console.WriteLine()
End Sub 'PrintIndexAndValues
End Class 'SamplesArray
'This code produces the following output.
'
'The Array initially contains the following values:
'[0] : The
'[1] : QUICK
'[2] : BROWN
'[3] : FOX
'[4] : jumps
'[5] : over
'[6] : the
'[7] : lazy
'[8] : dog
'
'After sorting a section of the Array using the default comparer:
'[0] : The
'[1] : BROWN
'[2] : FOX
'[3] : QUICK
'[4] : jumps
'[5] : over
'[6] : the
'[7] : lazy
'[8] : dog
'
'After sorting a section of the Array using the reverse case-insensitive comparer:
'[0] : The
'[1] : QUICK
'[2] : FOX
'[3] : BROWN
'[4] : jumps
'[5] : over
'[6] : the
'[7] : lazy
'[8] : dog
'
'After sorting the entire Array using the default comparer:
'[0] : BROWN
'[1] : dog
'[2] : FOX
'[3] : jumps
'[4] : lazy
'[5] : over
'[6] : QUICK
'[7] : the
'[8] : The
'
'After sorting the entire Array using the reverse case-insensitive comparer:
'[0] : the
'[1] : The
'[2] : QUICK
'[3] : over
'[4] : lazy
'[5] : jumps
'[6] : FOX
'[7] : dog
'[8] : BROWN
二维数组排序 vb.netDim i As Integer, j As Integer, X As Single, Y As Single, M As Single
i = L
j = R
'找出数组的中点
M = MyArray((L + R) / 2, 0)
While (i = j)
'找出比中点大的数
While (MyArray(i, 0)M And iR)
i = i + 1
Wend
'找出比中点小的数
While (MMyArray(j, 0) And jL)
j = j - 1
Wend
'互换这两个数
If (i = j) Then
X = MyArray(i, 0)
Y = MyArray(i, 1)
MyArray(i, 0) = MyArray(j, 0)
MyArray(i, 1) = MyArray(j, 1)
MyArray(j, 0) = X
MyArray(j, 1) = Y
i = i + 1
j = j - 1
End If
Wend
'未完成时递归调用
If (Lj) Then Call QuickSort(MyArray(), L, j)
If (iR) Then Call QuickSort(MyArray(), i, R)
End Sub
【vb.net数组排序 vbscript 数组】vb.net数组排序的介绍就聊到这里吧,感谢你花时间阅读本站内容,更多关于vbscript 数组、vb.net数组排序的信息别忘了在本站进行查找喔 。

推荐阅读