一 ,直接插入排序
int[] xx = {3, 2, 1, 5, 4, 3, 2};
int xLenth = xx.length;
int temp = 0;
for(int i=1 ; i<xLenth ; i++){
int j=i-1; //初始化 j 第一次为0
temp = xx[i]; //提取当前比较的值 temp 第一次为2
//循环将 temp 也就是 xx[i] 的值与它所在坐标之前的数字进行比较。如果发现大于temp的数字,则将此元素后移
for (; j>=0 && temp<xx[j] ;j--)
xx[j+1] = xx[j];
/**
* 这里有一个逻辑小问题,容易被忽略 。我们初始化的 j 为0,j+1 不就是 1 了么?貌似就有点懵逼了
* 请注意上面的for循环,我们拿第一次循环来看,j = 0 ;而且temp = 2 小于了 xx[j] 也就是3 ,也通过,
* 紧跟着进行了一次 j-- 所以 j 等于了 -1 。 如果不进入循环,那么 xx[j+1] 就等于了 x[i] ,
* 也就是不作变动
*/
xx[j+1] = temp;
}
for(int i=0;i< xlenth;i++)
System.out.print(xx[i]);
二 、希尔排序
int[] a = {3, 2, 1,9,4,6,4,2,7,3,4,6,8};
double d1 = a.length;
int temp = 0 ;
while(true){
d1 = Math.ceil(d1/2);
int d = (int) d1; //设置增量
for (int x = 0 ; x<d ; x++){
/**
* 下面就是直接插入排序了,
* 变动就是把 增量换了。
*/
for (int i=x+d ; i<a.length ; i+=d){
int j = i-d;
temp = a[i];
for (; j >= 0 && temp < a[j] ; j-=d){
a[j+d] = a[j];
}
a[j+d] = temp;
}
}
if (d==1)
break;
}
for(int i = 0 ; i<a.length;i++) {
System.out.print(";" + a[i]);
}
三、简单选择排序
int[] a = {3, 2, 1,9,4,6,4,2,7,3,4,6,8};
for (int x=0 ; x<a.length ; x++){
for (int y=x+1 ; y<a.length ; y++){
int temp = 0 ;
if (a[x]>a[y]){
temp = a[x];
a[x] = a[y];
a[y] = temp;
}
}
}
for(int i = 0 ; i<a.length;i++) {
System.out.print(";" + a[i]);
}
四、堆排序
publicclass HeapSort {
inta[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};
public HeapSort(){
heapSort(a);
}
public void heapSort(int[] a){
System.out.println("开始排序");
int arrayLength=a.length;
//循环建堆
for(int i=0;i<arrayLength-1;i++){
//建堆
buildMaxHeap(a,arrayLength-1-i);
//交换堆顶和最后一个元素
swap(a,0,arrayLength-1-i);
System.out.println(Arrays.toString(a));
}
}
private void swap(int[] data, int i, int j) {
// TODO Auto-generated method stub
int tmp=data[i];
data[i]=data[j];
data[j]=tmp;
}
//对data数组从0到lastIndex建大顶堆
privatevoid buildMaxHeap(int[] data, int lastIndex) {
// TODO Auto-generated method stub
//从lastIndex处节点(最后一个节点)的父节点开始
for(int i=(lastIndex-1)/2;i>=0;i--){
//k保存正在判断的节点
int k=i;
//如果当前k节点的子节点存在
while(k*2+1<=lastIndex){
//k节点的左子节点的索引
int biggerIndex=2*k+1;
//如果biggerIndex小于lastIndex,即biggerIndex+1代表的k节点的右子节点存在
if(biggerIndex<lastIndex){
//若果右子节点的值较大
if(data[biggerIndex]<data[biggerIndex+1]){
//biggerIndex总是记录较大子节点的索引
biggerIndex++;
}
}
//如果k节点的值小于其较大的子节点的值
if(data[k]<data[biggerIndex]){
//交换他们
swap(data,k,biggerIndex);
//将biggerIndex赋予k,开始while循环的下一次循环,重新保证k节点的值大于其左右子节点的值
k=biggerIndex;
}else{
break;
}
}
}
}
}
批注:此排序转载于http://blog.csdn.net/qy1387/article/details/7752973五、冒泡排序
简单的说就是从第一个元素开始,提出这个元素依次后它之后的元素比较,如果发现比它小(或大)的元素
就交换它们两的位置
int aa[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};
int length = aa.length;
for(int x = 0 ; x < length - 1 ; x++){
for (int y = 0 ; y < length - 1 - x ;y++){
int temp = 0;
if (aa[y] > aa[y+1]){
temp = aa[y];
aa[y] = aa[y+1];
aa[y+1] = temp;
}
}
}
for (int i = 0 ; i <length ; i++){
if(i!=0)
System.out.print("," + aa[i]);
}
System.out.println();
//第二种方式
int a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};
int lengthA = aa.length;
for (int x = 0 ; x < lengthA - 1 ; x++ ){
for (int y = lengthA - 1 ; y > x ; y--){
int temp = 0;
if (a[y] < a[y-1]){
temp = a[y];
a[y] = a[y-1];
a[y-1] = temp;
}
}
}
for (int i = 0 ; i <length ; i++){
if(i!=0)
System.out.print("," + a[i]);
}
六、快速排序
public static void main(String[] args) {
int aa[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};
_quickSort(aa,0,aa.length-1);
for (int i = 0 ; i<aa.length ; i++)
System.out.print("," + aa[i]);
}
//快速排序
public static int getMiddle(int[] list, int low, int high) {
int middle = list[low];
while (low<high){
while (low<high && list[high] >= middle){
high--;
}
list[low] = list[high];
while (low<high && list[low] <= middle){
low++;
}
list[high] = middle;
}
return low;
}
public static void _quickSort(int[] list, int low, int high) {
if (low < high){
int middle = getMiddle(list,low,high);
_quickSort(list , low,middle-1);
_quickSort(list , middle+1 , high);
}
}