VB.NET中的“冒泡排序”問題

如果五個號碼為數(shù)組元素（1）到（5），正確的排序過程：

成都創(chuàng)新互聯(lián)公司是一家專注于做網(wǎng)站、成都網(wǎng)站制作與策劃設(shè)計,迎江網(wǎng)站建設(shè)哪家好?成都創(chuàng)新互聯(lián)公司做網(wǎng)站,專注于網(wǎng)站建設(shè)十多年,網(wǎng)設(shè)計領(lǐng)域的專業(yè)建站公司;建站業(yè)務(wù)涵蓋:迎江等地區(qū)。迎江做網(wǎng)站價格咨詢:028-86922220

對于i = 1至4

對于L = 1到5 - 如果A（L）（L +1）

N = A（L）

A（L），= A（L +1）

（L +1） =

結(jié)束如果下一頁l

接下來，我

能夠到第一臺計算機來驗證結(jié)果，然后分析程序。

(VB.NET)編寫完整程序，分別模擬實現(xiàn)順序查找，二分查找，選擇排序，改進(jìn)的選擇排序，冒泡排序，

10分太少了，題目多，而且寫了也不一定會采納，所以沒人回答。

vb.net冒泡排序法代碼

試試看：

For?i?=?LBound(moto)?To?UBound(moto)?-?1

For?j?=?LBound(moto)?To?UBound(moto)?-?1?-?i

If?moto(j)??moto(j?+?1)?Then

t?=?moto(j)

moto(j)?=?moto(j?+?1)

moto(j?+?1)?=?t

End?If

Next?j

Next?i

For?i?=?LBound(moto)?To?UBound(moto)

Print?moto(i);

Next?i

編寫一個 VB.NET 程序,產(chǎn)生 100 個 100 以內(nèi)的隨機數(shù)，將他們從大到小排序后輸出

Private Sub Command1_Click()

Dim a(1 To 100) As Integer

Dim i As Integer, j As Integer, k As Integer

For i = 1 To 100 '給數(shù)組a一百個元素賦值，并換每行十個數(shù)字輸出來窗體上

a(i) = Int(Rnd * 101)

k = k + 1

Print Tab((k - 1) * 5); a(i);

If k = 10 Then k = 0: Print

Next i

Print

Print

For i = 100 To 2 Step -1 '用冒泡排序法對數(shù)組進(jìn)行排序

For j = 1 To i - 1

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

For i = 1 To 100 '輸出排好序的數(shù)組

k = k + 1

Print Tab((k - 1) * 5); a(i);

If k = 10 Then k = 0: Print

Next i

End Sub

VB.NET數(shù)組的排序法？

如果你是從vb6剛過渡上vb。net，建議還是用冒泡排序法，容易理解。

如果你正努力學(xué)習(xí)vb。net的方法，推薦一個例子如下：

Imports System

Imports System.Collections

Public Class SamplesArray

Public Class myReverserClass

Implements IComparer

' Calls CaseInsensitiveComparer.Compare with the parameters reversed.

Function Compare(x As Object, y As Object) As Integer _

Implements IComparer.Compare

Return New CaseInsensitiveComparer().Compare(y, x)

End Function 'IComparer.Compare

End Class 'myReverserClass

Public Shared Sub Main()

' Creates and initializes a new Array and a new custom comparer.

Dim myArr As [String]() = {"The", "QUICK", "BROWN", "FOX", "jumps", "over", "the", "lazy", "dog"}

Dim myComparer = New myReverserClass()

' Displays the values of the Array.

Console.WriteLine("The Array initially contains the following values:")

PrintIndexAndValues(myArr)

' Sorts a section of the Array using the default comparer.

Array.Sort(myArr, 1, 3)

Console.WriteLine("After sorting a section of the Array using the default comparer:")

PrintIndexAndValues(myArr)

' Sorts a section of the Array using the reverse case-insensitive comparer.

Array.Sort(myArr, 1, 3, myComparer)

Console.WriteLine("After sorting a section of the Array using the reverse case-insensitive comparer:")

PrintIndexAndValues(myArr)

' Sorts the entire Array using the default comparer.

Array.Sort(myArr)

Console.WriteLine("After sorting the entire Array using the default comparer:")

PrintIndexAndValues(myArr)

' Sorts the entire Array using the reverse case-insensitive comparer.

Array.Sort(myArr, myComparer)

Console.WriteLine("After sorting the entire Array using the reverse case-insensitive comparer:")

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.net的隨機3個數(shù)字，然后排序一下

給你一個最簡單的冒泡排序代碼：

將三個數(shù)放到一個數(shù)組中。

a(0)=val(text1.text):a(1)=val(text2.text):a(2)=val(text3.text)

dim flag as Boolean,temp as Integer

for i = 0 to 2

flag = true

for j = 2 to 1

if a(j)a(j-1) then

temp = a(j-1)

a(j-1) = a(j)

a(j) = temp

flag = false

end if

next j

if flag then Exit For

next i

text4.text=a(0):text5.text=a(1):text6.text=a(2)

文章標(biāo)題：vb.net冒泡排序 net 冒泡排序
路徑分享：http://www.chinadenli.net/article30/dooicpo.html

成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián)，為您提供軟件開發(fā)、網(wǎng)站維護(hù)、云服務(wù)器、定制開發(fā)、自適應(yīng)網(wǎng)站、品牌網(wǎng)站建設(shè)

廣告

聲明：本網(wǎng)站發(fā)布的內(nèi)容（圖片、視頻和文字）以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主，如果涉及侵權(quán)請盡快告知，我們將會在第一時間刪除。文章觀點不代表本網(wǎng)站立場，如需處理請聯(lián)系客服。電話：028-86922220；郵箱：631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載，或轉(zhuǎn)載時需注明來源： 創(chuàng)新互聯(lián)