总结排序方式:冒泡排序(优化冒泡排序),选择排序
package paixu;
import java.util.Arrays;
import java.util.Date;
public class Paixu {
private static int[] numArr = initNumArr(10000);//初始化数组大小
public static void main(String[] args) {
int[] maopaoSort2 = maopaoSort2(numArr);
int[] maopaoSort = maopaoSort(numArr);
int[] selectSort = selectSort(numArr);
}
/**
* 初始化数组
* @param i 数组长度
* @return
*/
public static int[] initNumArr(int i) {
int[] numArr = new int[i];
for(int ii=0;ii<i;ii++)
numArr[ii]=(int) (Math.random()*i);
return numArr;
}
/**
* 优化的冒泡排序;比正常冒泡少跑数组length-1次
* @param numArr 排序数组
* @return
*/
public static int[] maopaoSort(int[] numArr) {
int ix=0;//循环执行次数
long l = new Date().getTime();
for(int i=0;i<numArr.length;i++) {
for(int ii=i+1;ii<numArr.length-1;ii++) {
if(numArr[i]>numArr[ii]) {
int index = numArr[i];
numArr[i]=numArr[ii];
numArr[ii]=index;
}
ix++;
}
}
System.out.println(ix+"maopaosort:"+(new Date().getTime()-l));//打印执行时间与次数
return numArr;
}
/**
* 原始冒泡排序
* @param numArr
* @return
*/
public static int[] maopaoSort2(int[] numArr) {
int ix=0;//循环执行次数
long l = new Date().getTime();
for(int i=0;i<numArr.length;i++) {
//int t = numArr[i];
for(int ii=0;ii<numArr.length-i-1;ii++) {
ix++;
if(numArr[ii]>numArr[ii+1]) {
int index = numArr[ii];
numArr[ii]=numArr[ii+1];
numArr[ii+1]=index;
}
//System.out.println(Arrays.toString(numArr));
}
}
System.out.println(ix+"maopaosort:"+(new Date().getTime()-l));//打印执行时间与次数
return numArr;
}
/**
* 选择排序
* @param numArr
* @return
*/
public static int[] selectSort(int[] numArr) {
int ix=0;//循环执行次数
long l = new Date().getTime();
for(int i=0;i<numArr.length;i++) {
int min =i;
for(int j=i+1;j<numArr.length;j++) {
if(numArr[min]>numArr[j]) {
min=j;
//continue;
break;//49995000
}
ix++;
}
if(min!=i) {
int x =numArr[i];
numArr[i]=numArr[min];
numArr[min]=x;
}
}
System.out.println(ix+"maopaosort:"+(new Date().getTime()-l));//打印执行时间与次数
return numArr;
}
}