选择排序
2016-05-07 17:15
253 查看
Private Sub Command1_Click()
Me.Font.Size = 30
Dim a(10) As Integer
Dim i As Integer
For i = 1 To 10
a(i) = 10 + Int(Rnd() * 100)
Print a(i)
Next i
Dim j As Integer
For j = 1 To 9
For i = j + 1 To 10
If a(j) < a(i) Then
swap a(j), a(i)
End If
Next i
Next j
For i = 1 To 10
Print (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
Me.Font.Size = 30
Dim a(10) As Integer
Dim i As Integer
For i = 1 To 10
a(i) = 10 + Int(Rnd() * 100)
Print a(i)
Next i
Dim j As Integer
For j = 1 To 9
For i = j + 1 To 10
If a(j) < a(i) Then
swap a(j), a(i)
End If
Next i
Next j
For i = 1 To 10
Print (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
相关文章推荐
- Codeforces Beta Round #97 (Div. 1) C. Zero-One 数学
- Linux下high CPU分析心得【非原创】
- Elasticsearch多索引
- 2 变量、常量、printf、scanf
- 一起学Netty(二)之 Hello Netty的原型图解
- 解决 U盘安装Centos后拔除U盘无法启动问题方法,重新建立引导分区
- 信号
- 起泡法排序
- 阶乘之和 输入n,计算S=1!+2!+3!+…+n!的末6位(不含前导0)。n≤10 6 ,n!表示 前n个正整数之积。
- WEB网站类型系统中使用的OFFICE控件
- 框架选择
- 一起学Netty(一)之 Hello Netty
- Mac下安装opencv-python
- getColor(int id) is deprecated
- Android 中Textview字体加粗
- nyoj 148 fibonacci数列(二)
- Hadoop集群WordCount详解
- 第十周第十一周上机实践项目-项目3-1-警察和厨师
- 二叉树中所有节点的左右子树相互交换 递归与非递归程序
- 关于while(geline(cin,s))语句执行解释