排序
来源:互联网 发布:apache垃圾回收机制 编辑:程序博客网 时间:2024/05/19 15:40
Private Sub 排序_Click()
Cls
Dim a As Integer
Dim b As Integer
Dim c As Integer
Dim d As Integer
Dim e As Integer
Dim f As Integer
Dim g As Integer
Dim h As Integer
Dim i As Integer
Dim j As Integer
Dim k As Integer
Dim l As Integer
Dim m As Integer
Dim n As Integer
Dim o As Integer
a = Int(Rnd * 1000)
b = Int(Rnd * 1000)
c = Int(Rnd * 1000)
d = Int(Rnd * 1000)
e = Int(Rnd * 1000)
f = Int(Rnd * 1000)
g = Int(Rnd * 1000)
h = Int(Rnd * 1000)
i = Int(Rnd * 1000)
j = Int(Rnd * 1000)
k = Int(Rnd * 1000)
l = Int(Rnd * 1000)
m = Int(Rnd * 1000)
n = Int(Rnd * 1000)
o = Int(Rnd * 1000)
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If g < h Then
Call swap(g, h)
End If
If h < i Then
Call swap(h, i)
End If
If i < j Then
Call swap(i, j)
End If
If j < k Then
Call swap(j, k)
End If
If k < l Then
Call swap(k, l)
End If
If l < m Then
Call swap(l, m)
End If
If m < n Then
Call swap(m, n)
End If
If n < o Then
Call swap(n, o)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If g < h Then
Call swap(g, h)
End If
If h < i Then
Call swap(h, i)
End If
If i < j Then
Call swap(i, j)
End If
If j < k Then
Call swap(j, k)
End If
If k < l Then
Call swap(k, l)
End If
If l < m Then
Call swap(l, m)
End If
If m < n Then
Call swap(m, n)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If g < h Then
Call swap(g, h)
End If
If h < i Then
Call swap(h, i)
End If
If i < j Then
Call swap(i, j)
End If
If j < k Then
Call swap(j, k)
End If
If k < l Then
Call swap(k, l)
End If
If l < m Then
Call swap(l, m)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If g < h Then
Call swap(g, h)
End If
If h < i Then
Call swap(h, i)
End If
If i < j Then
Call swap(i, j)
End If
If j < k Then
Call swap(j, k)
End If
If k < l Then
Call swap(k, l)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If g < h Then
Call swap(g, h)
End If
If h < i Then
Call swap(h, i)
End If
If i < j Then
Call swap(i, j)
End If
If j < k Then
Call swap(j, k)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If g < h Then
Call swap(g, h)
End If
If h < i Then
Call swap(h, i)
End If
If i < j Then
Call swap(i, j)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If g < h Then
Call swap(g, h)
End If
If h < i Then
Call swap(h, i)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If g < h Then
Call swap(g, h)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If e < f Then
Call swap(e, f)
End If
If f < g Then
Call swap(f, g)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
If e < f Then
Call swap(e, f)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If d < e Then
Call swap(d, e)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If c < d Then
Call swap(c, d)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If a < b Then
Call swap(a, b)
End If
If b < c Then
Call swap(b, c)
End If
If a < b Then
Call swap(a, b)
End If
Print a & "," & b &"," & c & "," & d & "," &e & "," & f & "," & g & ","& h & "," & i & "," & g &"," & k & "," & l & "," & m& "," & n & "," & o
End If
End Sub
Private Sub swap(x As Integer, y AsInteger)
Dim temp As Integer
If x < y Then
temp = x
x= y
y= temp
End If
End Sub
刘兆国
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 排序
- 自定义Dialog
- 15个数排序
- 改变Android状态栏字体颜色和实现沉浸式状态栏
- php 对二维数组的某个键的值进行排序
- LINUX挂载局域网硬盘和NFS
- 排序
- AngularJS进阶(二十五)requirejs + angular + angular-route 浅谈HTML5单页面架构
- AndroidStudio使用技巧
- 重学数据结构系列之——平衡树之SB Tree(Size Blanced Tree)
- Linux 上实现双向进程间通信管道
- 经典架构篇,请阅读
- 对于Linux的初级使用
- Android studio如何集成ShareSDK详解
- Android实现计时与倒计时(限时抢购)的几种方法