冒泡法排序
2016-06-16 17:09
197 查看
Private Sub Command1_Click()
Dim a(10) As Integer
Dim i As Integer
Dim j As Integer
For i = 1 To 10
a(i) = 10 + Int(Rnd() * 1000)
Print a(i);
Next i
Print
For i = 1 To 9
For j = 1 To 10 - i
If a(j) < a(j + 1) Then
swap a(j), a(j + 1)
End If
Next j
Next i
For i = 1 To 10
Print a(i);
Next i
Print
End Sub
Private Sub swap(a As Integer, b As Integer)
Dim t As Integer
t = a
a = b
b = t
End Sub
15电气臧洪颖
Dim a(10) As Integer
Dim i As Integer
Dim j As Integer
For i = 1 To 10
a(i) = 10 + Int(Rnd() * 1000)
Print a(i);
Next i
For i = 1 To 9
For j = 1 To 10 - i
If a(j) < a(j + 1) Then
swap a(j), a(j + 1)
End If
Next j
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
15电气臧洪颖
相关文章推荐
- 匹配(工作分配问题)
- 【.Net码农】GridView事件大全
- 梦断代码阅读笔记03
- 使用CSS3 Media Queries实现网页自适应(转)
- TrueSkill 原理及实现
- Android ViewPager
- php对csv文件的读取,写入,输出下载操作
- dedecms5.7安装百度(ueditor)编辑器的方法
- idea代码调试debug篇
- 卡方检验 Chi-square test
- C#中数组、ArrayList和List三者的区别
- 简单的划分数据
- public、private、protected的区别
- ORA-19809: 超出了恢复文件数的限制解决
- 基于Eclipse Maven的Spring4/Spring-MVC/Hibernate4整合之三:hibernate4泛型dao的应用
- laragon环境更新安装新的php版本操作方法
- 顺序栈和链栈实现
- Linux ssh免密登录
- UVa 10970
- 分类算法 之 朴素贝叶斯--理论解读