sort-冒泡排序法

package Sort;


import java.util.Random;


/**
* 
*冒泡排序法、 
* 
**/


public class BubbleSort {
public static void BubbleSort(int[] a )
{
int t = 0;
int loop = 1;
for(int i=0;i<a.length-1;i++)
{
for(int j = 1;j<a.length-i;j++)
{
if(a[j-1]>a[j]){
t=a[j-1];
a[j-1]=a[j];
a[j]=t;
}
System.out.println("第"+loop+"趟");
loop++;
for(int k=0;k<a.length;k++){
System.out.println(a[k]+"  ");
}
System.out.println();
}
System.out.println("----------");
}
}
public static void main(String[] args) {

int a[] = new int[10000];
Random ran = new Random();
for(int i=0;i<9999;i++){
a[i] = ran.nextInt(10000);
if(i % 100==0)
System.out.println("");
System.out.print(a[i] + " ");
}
long starttime = System.currentTimeMillis();



BubbleSort(a);


long endtime = System.currentTimeMillis();
System.out.println("排序共花费"+(endtime-starttime)+"毫秒");
}
}