插入排序类:
直接插入排序:
最好情况:O(n)
最坏情况和平均情况O(n^2)
稳定
根据下面的代码分析可知:
对基本有序的数据,少量操作就可以排完序;
package 直接插入排序;
public class StraightInsertSort {
// static int[] sqlist = {0,9,8,7,5,6,4,3,2,1,12,23,11};
static int[] sqlist = {0,5,3,4,6,2};
public static void main(String[] args) {
// TODO Auto-generated method stub
straightinsertsort(sqlist);
for (int i = 1; i < sqlist.length; i++) {//0不被排序
System.out.print(sqlist[i]+" ");
}
}
/*将一次遍历的数插入已经遍历排好序的有序表中
*因为要储存被遍历的数,所以要设置一个哨兵,sqlist[0]
*时间复杂度也为O(n^2),但是比冒泡和简单选择排序性能好一些*/
private static void straightinsertsort(int[] sqlist) {
// TODO Auto-generated method stub
int j;
for (int i = 2; i < sqlist.length; i++) {
sqlist[0] = sqlist[i];//储存这次用来插入有序序列的数sqlist[i];
//下面的循环就遍历,i之前的数,如果大于sqlist[i]就继续,否则跳出
for (j = i-1; sqlist[j]>sqlist[0]; j--) {//哨兵还判断了临界条件,当j=0时,自动退出当前循环
sqlist[j+1] = sqlist[j];
}
//跳出插入把sqlist[i]插入合适的位置
sqlist[j+1]=sqlist[0];
}
}
}
希尔排序:
最好情况:O(n^1.3)
最坏情况:O(n^2)
平均:O(nlogn)-->O(n^2)
不稳定
package 希尔排序;
public class ShellSort {
//static int[] sqlist = {0,9,8,7,5,6,4,3,2,1,12,23,11};
static int[] sqlist = {0,9,1,5,8,3,7,4,6,2};
public static void main(String[] args) {
// TODO Auto-generated method stub
shellsort(sqlist);
for (int i = 1; i < sqlist.length; i++) {//0不被排序
System.out.print(sqlist[i]+" ");
}
}
private static void shellsort(int[] sqlist2) {
// TODO Auto-generated method stub
int increment = sqlist2.length;
int j = 0;
while (increment>1) {
increment = increment/3+1;
for (int i = increment+1; i < sqlist2.length; i++) {
if (sqlist2[i-increment]>sqlist2[i]) {
sqlist2[0] = sqlist2[i];
for (j=i-increment;j>0&&sqlist2[j]>sqlist2[0]; j-=increment) {
sqlist2[j+increment] = sqlist2[j];
}
sqlist2[j+increment] = sqlist2[0];
}
}
}
}
}