Java入门:冒泡排序

package org.lxh.demo16.common;

import java.util.Random;

public class BubbleSort {

static void print(int a[]){
for(int i = 0; i < a.length; i++)
System.out.print(a[i] + " ");

System.out.println("");
}

//冒泡排序
int[] sort(int a[]){
int n = a.length;
int tmp;

for(int i = n-1; i >= 1; i--){
for(int j =0; j < i; j++){
if(a[j] > a[j+1]){
tmp = a[j];
a[j] = a[j+1];
a[j+1] = tmp;
}
}
}

return a;
}

//main
@SuppressWarnings("static-access") 		//消除利用类变量调用static成员的警告
//st.print(b);
public static void main(String[] args){

BubbleSort st = new BubbleSort();

//int arr[] = {10,23,56,45,26,29,56,84,96};

Random random = new Random();
int arr[] = new int[20];		//20

for(int i=0; i<arr.length; i++){
arr[i] = Math.abs(random.nextInt() % 500);		//500
}

System.out.println("初始数组为: ");
print(arr);					//correct

int[] b = st.sort(arr);

System.out.println("排序后数组为: ");

st.print(b);				//warning
BubbleSort.print(b);		//correct
}
}