整了一个晚上加半个早上终于整理好了 边做边理解
选择排序 冒泡排序 插入排序 折半排序 快速排序 堆排序 时间测试
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define random(x) (5000+rand()%x)
//@RookieCui
void CreatTable(int a[],int n){
srand((int)time(0));
for(int x=0;x<= n;x++)
a[x] = random(50000);
}
void disp(int a[],int low,int high){
for(int i = low;i <= high;i++){
printf("%d ",a[i]);
}
printf("\n");
}
//插入排序
void InsertSort(int a[],int n){
int i;
int j;
for(i = 2;i <= n;i++)
if(a[i] < a[i - 1]){
a[0] = a[i];
a[i] = a[i - 1];
for(j = i - 2;a[0] < a[j];--j)
a[j + 1] = a[j];
a[j + 1] = a[0];
}
}
//冒泡排序
void mPSort(int a[],int n){
for(int i = 1;i < n;i++){
for(int j = 1;j <= n - i;j++)
if(a[j] > a[j + 1]){
a[0] = a[j];
a[j] = a[j + 1];
a[j + 1] = a[0];
}
}
}
//选择排序
int SelectOne(int a[],int n,int i){
int k = i;
int j;
for(j = i + 1;j <= n;j++){
if(a[j] < a[k])
k = j;
return k;
}
}
void SelecSort(int a[],int n){
int j;
for(int i = 1;i < n;++i){
j = SelectOne(a,n,i);
if(i != j){
a[0] = a[i];
a[i] = a[j];
a[j] = a[0];
}
}
}
void swap(int *p1,int *p2)
{
int temp;
temp=*p1;
*p1=*p2;
*p2=temp;
}
void select_sort(int *a,int n)
{
int i,j,small;
for(i=0;i<n-1;i++)
{
small=i;
for(j=i+1;j<n;j++)
{
if(a[j]<a[i])
{
small=j;
}
}
swap(&a[i],&a[small]);
}
}
void sift(int a[], int i, int n)
{
int child, tmp;
for (tmp = a[i]; n >= 2 * i; i = child)
{
/* i的左孩子为2*i,右孩子为2*i+1 */
child = 2 * i;
/* 让child指向孩子中较大的一个 */
if (child != n && a[child + 1] > a[child])
{
child++;
}
/* 如果孩子节点大 */
if (tmp < a[child])
{
/* 交换孩子节点和根节点 */
a[i] = a[child];
}
else break;
}
/* 将根放在合适位置 */
a[i] = tmp;
}
/* 对a[1...n]进行排序 */
//堆排序
void dSort(int a[], int n)
{
int i, tmp;
/* 将a[1...n]建成大根堆 */
for (i = n / 2; i >= 1; i--)
{
sift(a, i, n);
}
/* 进行n-1趟排序 */
for (i = n; i >= 2; i--)
{
/* 交换堆顶元素和最后一个元素 */
tmp = a[1];
a[1] = a[i];
a[i] = tmp;
/* 将a[1...i-1]重建为堆 */
sift(a, 1, i-1);
}
}
//快速排序
void kSort(int data[], int low, int high)
{
int i, j, pivot;
if (low < high)
{
pivot=data[low];
i=low;
j=high;
while(i<j)
{
while (i<j && data[j]>=pivot)
j--;
if(i<j)
data[i++]=data[j]; //将比枢轴记录小的记录移到低端
while (i<j && data[i]<=pivot)
i++;
if(i<j)
data[j--]=data[i]; //将比枢轴记录大的记录移到高端
}
data[i]=pivot; //枢轴记录移到最终位置
kSort(data,low,i-1);
kSort(data,i+1,high);
}
}
//折半排序
void zBSort(int a[],int n){
int i;
int low;
int m;
int j;
int high;
for(i = 2;i <= n;i++){
a[0] = a[i];
low = 1;
high = i - 1;
while(low <= high){
m = (low + high) / 2;
if(a[0] < a[m])
high = m - 1 ;
else low = m + 1;
}
for(j = i - 1;j >= high;--j)
a[j + 1] = a[j];
a[high + 1] = a[0];
}
}
int main(){
int n,*pn;
int *q,h;
double duration = 0.0;
long sInsert,fInsert,mPsSort,mPfSort,ssSort,sfSort,ksSort,kfSort,dsSort,dfSort,zsSort,zfSort;
printf("测试排序循环10000000次时间\n");
printf("请输入排序元素个数:" );
scanf("%d",&n);
pn = (int *)malloc((n+1)*sizeof(int));
CreatTable(pn,n);
printf("原始序列为:");
disp(pn,1,n);
sInsert = clock();
for(int i = 0; i <= 10000000;i++)
InsertSort(pn,n);
fInsert = clock();
duration = (double)(fInsert - sInsert);
//
duration = (double)(finish - start) / CLOCKS_PER_SEC;
printf("插入排序运行时间为:%.3f 毫秒\n",duration);
printf("排序后结果为:");
disp(pn,1,n);
mPsSort = clock();
for(int j = 0;j <= 10000000;j++)
mPSort(pn,n);
mPfSort = clock();
duration = (double)(mPfSort - mPsSort);
printf("冒泡排序运行时间为:%.3f 毫秒\n",duration);
printf("排序后结果为:");
disp(pn,1,n);
ksSort = clock();
for(int l = 0;l <= 10000000;l++)
kSort(pn,1,n);
kfSort = clock();
duration = (double)(kfSort - ksSort);
printf("快速排序运行时间为:%.3f 毫秒\n",duration);
printf("排序后结果为:");
disp(pn,1,n);
ssSort = clock();
for(int k = 0;k <= 10000000;k++)
SelecSort(pn,n);
sfSort = clock();
duration = (double)(sfSort - ssSort);
printf("选择排序运行时间为:%.3f 毫秒\n",duration);
printf("排序后结果为:");
disp(pn,1,n);
dsSort = clock();
for(int m = 0;m <= 10000000;m++)
dSort(pn,n);
dfSort = clock();
duration = (double)(dfSort - dsSort);
printf("堆排序运行时间为:%.3f 毫秒\n",duration);
printf("排序后结果为:");
disp(pn,1,n);
zsSort = clock();
for(int o = 0;o <= 10000000;o++)
zBSort(pn,n);
zfSort = clock();
duration = (double)(zfSort - zsSort);
printf("折半排序运行时间为:%.3f 毫秒\n",duration);
printf("排序后结果为:");
disp(pn,1,n);
return 0;
}