JAVA 冒泡选择插入排序算法总结

源代码如下：

package exercise;

import java.util.Arrays;

import java.util.Random;

public class paixu {

public static void main(String[] args) {

Random random=new Random();

int[] ary=new int[10000];

for(int i=0;i<ary.length;i++){

ary[i]=random.nextInt(10000);

}

int[] ary1=Arrays.copyOf(ary,ary.length);

int[] ary2=Arrays.copyOf(ary, ary.length);

long time1=System.currentTimeMillis();

bubble(ary);

long time2=System.currentTimeMillis();

select(ary1);

long time3=System.currentTimeMillis();

insert(ary2);

long time4=System.currentTimeMillis();

System.out.println("bubble"+(time2-time1));

System.out.println("select"+(time3-time2));

System.out.println("insert"+(time4-time3));

}

public static void bubble(int[] ary){

for(int i=0;i<ary.length-1;i++){

for(int j=0;j<ary.length-i-1;j++){

if(ary[j]>ary[j+1]){

int temp=ary[j];

ary[j]=ary[j+1];

ary[j+1]=temp;

}

}

}

System.out.println(Arrays.toString(ary));

}

public static void select(int[] ary){

for(int i=0;i<ary.length-1;i++){

for(int j=i+1;j<ary.length;j++){

if(ary[i]>ary[j]){

int temp=ary[i];

ary[i]=ary[j];

ary[j]=temp;

}

}

}

System.out.println(Arrays.toString(ary));

}

public static void insert(int[] ary){

int i=0,j=0,k=0;

for(i=1;i<ary.length;i++){

k=ary[i];

for(j=i-1;j>=0&&k<ary[j];j--){

ary[j+1]=ary[j];

}

ary[j+1]=k;

}

System.out.println(Arrays.toString(ary));

}

}