冒泡排序法
来源:互联网 发布:苍蝇水在淘宝怎么买 编辑:程序博客网 时间:2024/05/16 05:16
Me.Font.Size = 6
Dim a(10) As Integer
For i = 1 To 10
a(i) = 10 + Int(Rnd() * 100)
Print a(i)
Next i
Print
For i = 2 To 10
If a(1) < a(i) Then
swap a(1), a(i)
End If
Next i
Print
For i = 1 To 10
Print a(i)
Next i
For i = 3 To 10
If a(2) < a(i) Then
swap a(2), a(i)
End If
Next i
Print
For i = 1 To 10
Print a(i)
Next i
For i = 4 To 10
If a(3) < a(i) Then
swap a(3), a(i)
End If
Next i
Print
For i = 1 To 10
Print a(i)
Next i
For i = 5 To 10
If a(4) < a(i) Then
swap a(4), a(i)
End If
Next i
Print
For i = 1 To 10
Print a(i)
Next i
For i = 6 To 10
If a(5) < a(i) Then
swap a(5), a(i)
End If
Next i
Print
For i = 1 To 10
Print a(i)
Next i
For i = 7 To 10
If a(6) < a(i) Then
swap a(6), a(i)
End If
Next i
Print
For i = 1 To 10
Print a(i)
Next i
For i = 8 To 10
If a(7) < a(i) Then
swap a(7), a(i)
End If
Next i
Print
For i = 1 To 10
Print a(i)
Next i
For i = 9 To 10
If a(8) < a(i) Then
swap a(8), a(i)
End If
Next i
Print
For i = 1 To 10
Print a(i)
Next i
End Sub
Private Sub swap(a As Integer, b As Integer)
Dim t As Integer
t = a
a = b
b = t
End Sub
Dim a(10) As Integer
For i = 1 To 10
a(i) = 10 + Int(Rnd() * 100)
Print a(i)
Next i
For i = 2 To 10
If a(1) < a(i) Then
swap a(1), a(i)
End If
Next i
For i = 1 To 10
Print a(i)
Next i
For i = 3 To 10
If a(2) < a(i) Then
swap a(2), a(i)
End If
Next i
For i = 1 To 10
Print a(i)
Next i
For i = 4 To 10
If a(3) < a(i) Then
swap a(3), a(i)
End If
Next i
For i = 1 To 10
Print a(i)
Next i
For i = 5 To 10
If a(4) < a(i) Then
swap a(4), a(i)
End If
Next i
For i = 1 To 10
Print a(i)
Next i
For i = 6 To 10
If a(5) < a(i) Then
swap a(5), a(i)
End If
Next i
For i = 1 To 10
Print a(i)
Next i
For i = 7 To 10
If a(6) < a(i) Then
swap a(6), a(i)
End If
Next i
For i = 1 To 10
Print a(i)
Next i
For i = 8 To 10
If a(7) < a(i) Then
swap a(7), a(i)
End If
Next i
For i = 1 To 10
Print a(i)
Next i
For i = 9 To 10
If a(8) < a(i) Then
swap a(8), a(i)
End If
Next i
For i = 1 To 10
Print a(i)
Next i
End Sub
Private Sub swap(a As Integer, b As Integer)
Dim t As Integer
t = a
a = b
b = t
End Sub
0 0
- 【排序】冒泡排序法
- 常用排序-冒泡法排序
- 排序法之冒泡排序
- php排序&冒泡法排序
- 排序之冒泡排序法
- 排序算法--冒泡排序法
- 【PHP】冒泡排序法排序
- 排序算法--冒泡排序法
- 冒泡法排序
- 排序:冒泡法
- 冒泡排序法
- 冒泡法排序
- 冒泡法排序
- 冒泡排序法
- java 冒泡排序法
- 冒泡法排序
- 冒泡法排序
- 冒泡法排序
- python对于中文编码处理的几种方式
- 剑指offer 面试题(打印1到n最大的n位整数)(6)
- Dependency annotations: {@org.springframework.beans.factory.annotation.Autowired(required=true)
- HDU——1163Eddy's digital Roots(九余数定理+同余定理)
- emwin GUI自带的定时器无法进入的解决方案
- 冒泡排序法
- HDU——1397Goldbach's Conjecture(二分查找+素数打表)
- linux 常用命令
- 腾讯地图api调用示例-功能-画多边形画圆自动复制一个
- java读取properties文件
- 设计模式之抽象工厂模式(Abstract Factory)
- 扩展Ubuntu虚拟机的硬盘空间
- HDU——1009FatMouse's Trade(贪心+结构体+排序)
- 详解java定时任务