冒泡排序(下沉)
图解
js代码如下
/**
* 冒泡(下沉)排序
*/
function charuDemo() {
var arr = new Array(3, 6, 4, 2, 11, 10, 5);
for (var i = 1; i < arr.length; i++) {
for (var j = 0; j < arr.length - i; j++) {
if (arr[j] > arr[j + 1]) {
var temp = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = temp;
}
}
}
}
java 代码如下
import java.util.Arrays;
public class CopyOfDemo01 {
public static void main(String[] args) {
int[] arr = { 3, 6, 4, 2, 11, 10, 5 };
maopaoDemo(arr);
}
public static void maopaoDemo(int[] arry) {
for (int i = 1; i < arry.length; i++) {
for (int j = 0; j < arry.length - i; j++) {
if (arry[j] > arry[j + 1]) {
int temp = arry[j + 1];
arry[j + 1] = arry[j];
arry[j] = temp;
}
}
System.out.println(Arrays.toString(arry));
}
}
}
[3, 4, 2, 6, 10, 5, 11]
[3, 2, 4, 6, 5, 10, 11]
[2, 3, 4, 5, 6, 10, 11]
[2, 3, 4, 5, 6, 10, 11]
[2, 3, 4, 5, 6, 10, 11]
[2, 3, 4, 5, 6, 10, 11]