内部排序代码

#include<stdio.h>
#include<math.h>
#include<iostream.h>
#include<stdlib.h>
#define OK 1
#define FALSE 0
#define MAX_NUM 100
typedef int Status;
typedef int ElemType;
typedef struct SqList
{
ElemType r[MAX_NUM];
int length;
}SqList;
typedef SqList HeapType;
Status Exchange(ElemType &a,ElemType &b) {
ElemType t;
t=a;a=b;b=t;
return OK;
}
//直接插入排序
Status InsertSort(SqList &L)
{
int i,j;
for(i=2;i<=L.length;i++)
if(L.r[i]<L.r[i-1])
{
L.r[0]=L.r[i];
L.r[i]=L.r[i-1];
for(j=i-1;L.r[0]<L.r[j];j--)
L.r[j+1]=L.r[j];
L.r[j+1]=L.r[0];
}
return OK;
}
//希尔排序
void ShellInsert(SqList &L,int dk)
{
int i,j;
for(i=dk+1;i<=L.length;i++)
if(L.r[i]<L.r[i-dk])
{
L.r[0]=L.r[i];
for(j=i-dk;j>0&&L.r[0]<L.r[j];j-=dk)
L.r[j+dk]=L.r[j];
L.r[j+dk]=L.r[0];
}
}
Status ShellSort(SqList &L)
{
int i,j,t,n,dlta[10];
n=log(L.length)/log(2);
printf("请输入你要排序的趟数(系统将根据相关规则定义递增序列,但不能大于%d)：\n",n);
cin>>t;
for(j=1,i=t-1;i>=0;i--,j<<=1)
dlta[i]=j+1;
dlta[t-1]--;
for(i=0;i<t;i++)
ShellInsert(L,dlta[i]);
return OK;
}
//冒泡排序
Status MPSort(SqList &L)
{
int i,j;
for(i=1;i<L.length;i++)
for(j=1;j<L.length;j++)
if(L.r[j]>L.r[j+1])
Exchange(L.r[j],L.r[j+1]);
return OK;
}
//快速排序
int Partition(SqList &L,int low,int high)
{
int pivotkey=L.r[low];
L.r[0]=L.r[low];
while(low<high)
{
while(low<high&&L.r[high]>=pivotkey) high--;
L.r[low]=L.r[high];
while(low<high&&L.r[low]<=pivotkey) low++;
L.r[high]=L.r[low];
}
L.r[low]=L.r[0];
return low;
}
void Qsort(SqList &L,int low,int high)
{
if(low<high)
{
int pivotloc=Partition(L,low,high);
Qsort(L,low,pivotloc-1);
Qsort(L,pivotloc+1,high);
}
}
Status QuickSort(SqList &L)
{
Qsort(L,1,L.length);
return OK;
}
//简单选择排序
int SelectMinKey(SqList L,int i)
{
int k;
for(k=i;i<L.length;)
if(L.r[k]>L.r[++i])
k=i;
return k;
}
Status SelectSort(SqList &L)
{
int i,j;
for(i=1;i<L.length;i++)
{
j=SelectMinKey(L,i);
if(i!=j) Exchange(L.r[i],L.r[j]);
}
return OK;
}
//堆排序
typedef SqList HeapType;
void HeapAdjust(HeapType &H,int s,int m) {
int j;
ElemType rc=H.r[s];
for(j=2*s;j<=m;j*=2)
{
if(j<m&&H.r[j]<H.r[j+1]) j++;
if(rc>=H.r[j]) break;
H.r[s]=H.r[j];
s=j;
}
H.r[s]=rc;
}
Status HeapSort(HeapType &H)
{
int i;
for(i=H.length/2;i>0;i--)
HeapAdjust(H,i,H.length);
for(i=H.length;i>1;i--)
{
Exchange(H.r[1],H.r[i]);
HeapAdjust(H,1,i-1);
}
return OK;
}
//归并排序
void Merge(ElemType SR[],ElemType TR[],int i,int m,int n) {
int j,k;
for(j=m+1,k=i;i<=m&&j<=n;k++)
{
if(SR[i]<SR[j]) TR[k]=SR[i++];
else TR[k]=SR[j++];
}
while(i<=m) TR[k++]=SR[i++];
while(j<=n) TR[k++]=SR[j++];
}
void MSort(ElemType SR[],ElemType TR1[],int s,int t) {
int m;
ElemType TR2[MAX_NUM];
if(s==t) TR1[s]=SR[s];
else
{
m=(s+t)/2;
MSort(SR,TR2,s,m);
MSort(SR,TR2,m+1,t);
Merge(TR2,TR1,s,m,t);
}
}
Status MergeSort(SqList &L)
{
MSort(L.r,L.r,1,L.length);
return OK;
}
//主函数
Status main()
{
SqList L;
int i,t,d;
loop:puts("请输入待排序数组的元素个数:");
cin>>L.length;
puts("请输入你要排序的数组:");
for(i=1;i<=L.length;i++)
cin>>L.r[i];
puts("请选择你想要使用的排序方式：1.直接插入排序，2.希尔排序，3.冒泡排序，\n4.快速排序，5.简单选择排序，6.堆排序，7.归并排序:");
cin>>t;
switch(t)
{
case 1:InsertSort(L);break;
case 2:ShellSort(L);break;
case 3:MPSort(L);break;
case 4:QuickSort(L);break;
case 5:SelectSort(L);break;
case 6:HeapSort(L);break;
case 7:MergeSort(L);
}
puts("排序后结果为:");
for(i=1;i<=L.length;i++)
printf("%-3d",L.r[i]);
putchar('\n');
puts("你想要退出程序吗？(Y/N)");
getchar();
if(getchar()=='N')
{
system("CLS");
goto loop;
}
system("pause");
return OK;
}。