java经典冒泡排序

public class maopaofa {

	public static void main(String[] args) {
			int a[] = {23,43,75,1,456,78,678,80,789,55};
			System.out.println("排序前的数组:");
			for(int i=0;i<a.length;i++) {
				System.out.print(a[i]+" ");
			}
			System.out.println();
			for(int i=0;i<a.length;i++) {
				for(int j=0;j<a.length-i-1;j++) {
					int t=a[j];
					if(a[j]>a[j+1]) {
						t=a[j];
						a[j]=a[j+1];
						a[j+1]=t;
					}
				}
			}
			System.out.println("排序后的数组：");
			for(int i=0;i<a.length;i++)
				System.out.print(a[i]+" ");

	}

}