scala 选择排序 冒泡排序
2015-08-13 23:06
225 查看
def xuanze(a: Array[Int]) {
var j: Int = 0;
var i: Int = 0;
var index = 0;
var aLen = a.length -1 ;
for (i <- 0 to aLen) {
for(j <- 0 to aLen - i ) {
if (a(j) > a(index))
index = j ;
}
if(aLen-i != index) {
var temp = a(aLen-i) ;
println(a(index) + " " + index + " " + i + " " + temp +" " +(aLen - i));
a(aLen-i) = a(index);
a(index) = temp;
}
index = 0;
}
}
def maopao(a: Array[Int]) {
var j: Int = 0;
var i: Int = 0;
for (i <- 0 to a.length - 1; j <- 0 to a.length - i - 2) {
if (a(j) > a(j + 1)) {
var temp = a(j);
a(j) = a(j + 1);
a(j + 1) = temp;
}
}
}
var j: Int = 0;
var i: Int = 0;
var index = 0;
var aLen = a.length -1 ;
for (i <- 0 to aLen) {
for(j <- 0 to aLen - i ) {
if (a(j) > a(index))
index = j ;
}
if(aLen-i != index) {
var temp = a(aLen-i) ;
println(a(index) + " " + index + " " + i + " " + temp +" " +(aLen - i));
a(aLen-i) = a(index);
a(index) = temp;
}
index = 0;
}
}
def maopao(a: Array[Int]) {
var j: Int = 0;
var i: Int = 0;
for (i <- 0 to a.length - 1; j <- 0 to a.length - i - 2) {
if (a(j) > a(j + 1)) {
var temp = a(j);
a(j) = a(j + 1);
a(j + 1) = temp;
}
}
}
相关文章推荐
- 冒泡排序
- C#冒泡法排序算法实例分析
- Windows7下安装Scala 2.9.2教程
- Java数据结构及算法实例:冒泡排序 Bubble Sort
- c++冒泡排序示例分享
- Java数据结构及算法实例:选择排序 Selection Sort
- Java中的数组排序方式(快速排序、冒泡排序、选择排序)
- python冒泡排序算法的实现代码
- c语言实现冒泡排序、希尔排序等多种算法示例
- c#冒泡排序示例分享
- 浅谈php冒泡排序
- PHP简单选择排序算法实例
- Javascript冒泡排序算法详解
- C++冒泡排序算法实例
- C语言实现冒泡排序算法
- c语言冒泡排序法代码
- VC++实现选择排序算法简单示例
- 排序算法之PHP版快速排序、冒泡排序
- php排序算法(冒泡排序,快速排序)