java之氣泡排序
package cn.zhou.demo;
public class A {
public static void main(String[] args) {
int[] a = { 4, 7, 1, 2, 5, 6, 3, 8, 9, 0 };
int[] b = new int[a.length];
b = sort2(a);
for (int i = 0; i < b.length; i++)
System.out.println("sort:" + b[i]);
}
// 氣泡排序
public static int[] sort2(int[] a) {
/**
* length 10
*
* { 4, 7, 1, 2, 5, 6, 3, 8, 9, 0 };
* 程式執行過程推演：
* 0/10-1,0/10-1=9 > 4125637809
*
* 1/9,(0/10-1-1=8) >124536708 9
*
* 2/9,(0/7) > 12435607 89
*
* 3/9,0/6 > 1234506 789
*
* 4/9,0/10-1-4=5 >123405 6789
*
* 5/9,0/10-1-5=4 >12304 56789
*
* 6/9,10-1-6=3; >1203 456789
*
* 7/9,10-1-7=2 >102 3456789
*
* 8/9,1 > 01 23456789
*
*/
for (int i = 0; i < a.length - 1; i++) {
for (int k = 0; k < a.length - i - 1; k++) {
if (a[k] > a[k + 1]) {
int s = a[k + 1];
a[k + 1] = a[k];
a[k] = s;
}
}
}
return a;
&nb