插入并排序

头文件：排序.h

#include<iostream>
using namespace std;
#define MAXSIZE 100
typedef int KeyType;
typedef struct
{
	KeyType key;

}DataType;
typedef struct 
{
	DataType r[MAXSIZE+1];
	int length;
}SqList;
int BinSearch(SqList *S,int k)//折半查找
{
	int low,high,mid;
	low=1;
	high=S->length;
	while(low<=high)
	{
		mid=(low+high)/2;
		if(S->r[mid].key==k)
			return mid;//返回下标
		else if(S->r[mid].key>k)
			high=mid-1;
		else 
			low=mid+1;
	}
    return -1;//查找失败
}

源程序：

#include<iostream>
#include"排序.h"
#include"time.h"
using namespace std;
//*********************************************************
void StraightInsertSort(SqList *S)//直接插入排序
{
	int i,j;
	for(i=2;i<=S->length;i++)
    {
		S->r[0]=S->r[i];//将每一个元素复制到前哨战
		j=i-1;
		while(S->r[0].key<S->r[j].key)//对前i个元素插入排序
		{
			S->r[j+1]=S->r[j];
			j--;
		}
		S->r[j+1]=S->r[0];
	}
}
//*********************************************************
void BinaryInsertSort(SqList *S)//折半插入排序
{
	int i,j,low,high,mid;
	for(i=2;i<=S->length;i++)
	{
		S->r[0]=S->r[i];//将每一个元素复制到前哨战
		low=1;
	    high=i-1;
		while(low<=high)
		{
			mid=(low+high)/2;
			if(S->r[0].key>=S->r[mid].key)//判断元素在那一半
				low=mid+1;
			else
				high=mid-1;
		}
		for(j=i-1;j>=high+1;j--)//后移
			S->r[j+1]=S->r[j];
		S->r[high+1]=S->r[0];//插入
	}
}
//*********************************************************
void BubbleSort(SqList *S)//冒泡排序
{
	int i,j;
	for(i=1;i<=S->length;i++)
	{
		for(j=2;j<=1+S->length-i;j++)//先将最大的放在最后
			if(S->r[j].key<S->r[j-1].key)
			{
				S->r[0]=S->r[j];
				S->r[j]=S->r[j-1];
				S->r[j-1]=S->r[0];
			}
		//for(i=1;i<=S->length;i++)
	    	//cout<<S->r[i].key<<" ";
		//cout<<endl;
	}
}
//*********************************************************
void swap(int *a,int *b)//交换函数
{
	int temp;
	temp=*a;*a=*b;*b=temp;
}
void QuickSort(SqList *S,int low,int high)//快速排序
{
	int i=low,j=high;
	int tmp=S->r[(low+high)/2].key;
	do
	{
		while(i<high&&S->r[i].key<tmp) i++;
		while(j>low&&S->r[j].key>tmp) j--;
		if(i<=j)
		{
			swap(S->r[i].key,S->r[j].key);
			i++;
			j--;
		}
	}while(i<=j);
	if(i<high) QuickSort(S,i,high);
	if(j>low) QuickSort(S,low,j);

}
//*********************************************************
void ShellInsert(SqList *S,int gap)
{
	int i,j;
	for(i=gap+1;i<=S->length;i++)//每次移动一位，处理间隔一个步长的两个点
		if(S->r[i].key<S->r[i-gap].key)
		{
			S->r[0]=S->r[i];
			for(j=i-gap;j>0&&S->r[0].key<S->r[j].key;j=j-gap)
			{
				S->r[j+gap]=S->r[j];
			}
			S->r[j+gap]=S->r[0];
		}
}
int gaps[]={5,3,1};
void ShellSort(SqList *S,int gaps[],int t)//希尔排序
{
	int k;
	for(k=0;k<t;k++)
		ShellInsert(S,gaps[k]);
} 
//*********************************************************
void SelectSort(SqList *S)//选择排序
{
	int i,j,t;
	DataType tmp;
	for(i=1;i<S->length;i++)
	{
		for(j=i+1,t=i;j<=S->length;j++)
		{
			if(S->r[t].key>S->r[j].key)
				t=j;
		}
		tmp=S->r[t];
		S->r[t]=S->r[i];
		S->r[i]=tmp;
	}

}
//*********************************************************
void HeapAdjust(SqList *S,int n,int m)//S->r[n..m]中的记录关键字除r[n]外均满足堆的定义，本函数堆第n个结点进行筛选，使其成为大顶堆
{
	int i,j;
	DataType rc;
	rc=S->r[n];
	i=n;
	for(j=2*i;j<=m;j=j*2)//沿关键字较大的孩子结点向下筛选
	{
		if(j<m&&S->r[j].key<S->r[j+1].key)
			j=j+1;//为关键字较大的元素下标
		if(rc.key>S->r[j].key)break;
		S->r[i]=S->r[j];
		i=j;
	}
	S->r[i]=rc;//插入
}
void HeapSort(SqList *S)//堆排序
{
	int i;
	DataType tmp;
	for(i=S->length/2;i>0;i--)//将r[1..length]建成堆
		HeapAdjust(S,i,S->length);
	for(i=S->length;i>1;i--)
	{
		tmp=S->r[1];
		S->r[1]=S->r[i];
		S->r[i]=tmp;//堆顶元素和堆底元素交换，将大元素移到后面
		HeapAdjust(S,1,i-1);//将r[1..i-1]调整为堆，最后的一个最大值不动
	}
}
//*********************************************************
void Merge(DataType r[],DataType rf[],int u,int v,int t)//将r[u..v]和r[v+1..t]归并到rf[u..t]
{
	int i,j,k;
	for(i=u,j=v+1,k=u;i<=v&&j<=t;k++)
	{
		if(r[i].key<=r[j].key)
		{
			rf[k]=r[i];
			i++;
		}
		else
		{
			rf[k]=r[j];
			j++;
		}
	}
	while(i<=v){rf[k++]=r[i++];}
	while(j<=t){rf[k++]=r[j++];}

}
void MSort(DataType p[],DataType p1[],int n,int t)//将p[n..t]归并排序为p1[n..t]
{
	int m;
	DataType p2[MAXSIZE+1];//中间变量，存储部分排序结果
	if(n==t)p1[n]=p[n];
	else
	{
		m=(n+t)/2;
		MSort(p,p2,n,m);
		MSort(p,p2,m+1,t);
		Merge(p2,p1,n,m,t);//将p2[n..m]和p2[m+1..t]归并到p1[n..t]
	}
}
void MergeSort(SqList *S)//归并排序
{
	MSort(S->r,S->r,1,S->length);
}
//*********************************************************
SqList *S;
void Srand(int n)
{
	int i=1;
	time_t t;
	srand((unsigned int )time(&t));
    S=(SqList*)malloc(sizeof(SqList)*n);//申请空间
    S->length=n;
    for(i=1;i<=S->length;i++)
	{
		S->r[i].key=rand();
	}
}
void TIME(int k)
{
    time_t start=0,finish=0;
    double duration=0;
	start=clock();
	switch(k)
	{
		case 1:StraightInsertSort(S);break;
	    case 2:BinaryInsertSort(S);break;
		case 3:BubbleSort(S);break;
		case 4:QuickSort(S,1,S->length);break;
		case 5:ShellSort(S,gaps,3);break;
		case 6:SelectSort(S);break;
		case 7:HeapSort(S);break;
		case 8:MergeSort(S);break;
	}
	finish=clock(); 
	duration=(double)(finish-start);///CLOCKS_PER_SEC; 
	
	if(S->length<=50)
	for(int i=1;i<=S->length;i++)
	    cout<<S->r[i].key<<" ";
	else
	{
		cout<<"输出前50项:"<<endl;
	    for(int i=1;i<=50;i++)
	        cout<<S->r[i].key<<" ";
	}
	cout<<endl<<"#Time: "<<duration<<"ms #"<<endl;

}
void print()
{
	int k,n;
	cout<<"******************************"<<endl;
	cout<<"*                            *"<<endl;
	cout<<"*    欢迎使用排序选择系统    *"<<endl;
	cout<<"*                            *"<<endl;
    cout<<"******************************"<<endl;
    cout<<"请输入随机数个数n:"<<endl;
    cin>>n;
	Srand(n);

	cout<<"**********排序菜单:***********"<<endl;
	cout<<"*1.直接插入排序              *"<<endl;
	cout<<"*2.折半插入排序              *"<<endl;
	cout<<"*3.冒泡排序                  *"<<endl;
	cout<<"*4.快速排序                  *"<<endl;
	cout<<"*5.希尔排序                  *"<<endl;
	cout<<"*6.选择排序                  *"<<endl;
	cout<<"*7.堆排序                    *"<<endl;
	cout<<"*8.归并排序                  *"<<endl;
	cout<<"*0.退出                      *"<<endl;
    cout<<"******************************"<<endl;
    look:
	cout<<"请选择菜单:"<<endl;
	cin>>k;
	switch(k)
	{
	    case 1:TIME(1);break;
	    case 2:TIME(2);break;
		case 3:TIME(3);break;
		case 4:TIME(4);break;
		case 5:TIME(5);break;
		case 6:TIME(6);break;
		case 7:TIME(7);break;
		case 8:TIME(8);break;
	    case 0:cout<<"谢谢使用！"<<endl;exit(0);break;
	    default:cout<<"选择不正确！请重新选择！"<<endl;goto look;break;
	}
}
void Sort()
{
	int k;
	cout<<"请输入要折半查找的数："<<endl;
	cin>>k;
	cout<<"输出对应的序号："<<endl;
	if(BinSearch(S,k)==-1)
		cout<<"没有要查找的数！"<<endl;
	else
		cout<<BinSearch(S,k)<<endl;
}

int main()
{
	char c,c1;
	while(1)
	{
        	    print();
	    Sort();
		cout<<endl<<"是否继续？(y/n)"<<endl;
		scanf("%c",&c1);
		c=getchar();
		if(c=='y')continue;
		else break;
	}
    return 0;
}