/*
* author:wxg
*/
#include
#include
#include
/*
* 冒泡排序
*/
void bubbleSort(int a[],int n){
int i,j,tmp;
for(i=0;i
for(j=0;j
if(a[j]>a[j+1]){
tmp=a[j];
a[j]=a[j+1];
a[j+1]=tmp;
}
}
}
}
/*
* 直接插入排序
*/
void insertSort(int a[],int n){
int i,j;
for(i=1;i
int tmp = a[i];
for(j=i;j>0;j--){ //错误 for(j=i;j<0;j--)
if(tmp
a[j]=a[j-1];
else break;
}
a[j]=tmp;
}
}
/*
* 快速排序
*/
int partion(int a[],int low,int high){
int key=a[low];
while(low
while((low
a[low]=a[high]; // 错误 a[low++]=a[high--];
while((lowa[low])) low++;
a[high]=a[low]; //错误 a[high--]=a[low++];
}
a[low]=key;
return low;
}
void QSort(int a[],int low,int high){
if(low
int pivotloc = partion(a,low,high);
QSort(a,low,pivotloc-1);
QSort(a,pivotloc+1,high);
}
}
/*
* 选择排序
*/
void selectSort(int a[],int n){
int i,j,tmp,loc;
for(i=0;i
tmp = a[0];loc=0;
for(j=0;j
if(tmp