java排序算法之(冒泡排序法)
package sort;
public class BubbleSort {
/**
* @author Bill.hu
* @version 1.0 ,2007-4-16
* @param args
*/
public static void main(String[] args) {
// TODO 自动生成方法存根
int[] a = { 1, 9, 3, 98, 89, 45, 61, 26 };
BubbleSort bs = new BubbleSort();
bs.outPut(a);
int b[] = bs.sort(a);
bs.outPut(b);
}
public int[] sort(int[] a) {
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length - 1 - i; j++) {
if (a[j] > a[j + 1]) {
int tmp = a[j + 1];
a[j + 1] = a[j];
a[j] = tmp;
}
}
}
return a;
}
public void outPut(int[] a) {
for (int element : a) {
System.out.print(element + " ");
}
System.out.println("");
}
}