排序
Question one
#include "Arrayio.h"
#define N 500000
void insertSort(int a[],int n)
{
int i, j;
for(i = 2; i < n; i++)
{
a[0] = a[i];
j = i - 1;
while(a[j] > a[0])
{
a[j + 1] = a[j];
j--;
}
a[j + 1] = a[0];
}
}
int main()
{
int a[N+1],n;
printf("数据初始化...\n");
n=readData(a,N,"data1.txt");
printf("%d个数据排序中...\n",n);
insertSort(a,n);
saveData(a,n,"out.txt");
output(a,10);
printf("排序结束,排序结果保存在out.txt文件中。\n");
return 0;
}
Question two
#include "Arrayio.h"
#define N 10000
void binInsertSort(int a[],int n)
{
int mid, left, right, i, j;
for(i = 2; i < n; i++)
{
left = 1;
right = i - 1;
while(left <= right)
{
mid = (left + right)/2;
if(a[i] < a[mid]) right = mid - 1;
else left = mid + 1;
}
a[0] = a[i];
for( j = i - 1; j >= left; j--) a[j + 1] = a[j];
a[left] = a[0];
}
}
int main()
{
int a[N+1],n;
printf("数据初始化...\n");
n=readData(a,N,"data1.txt");
printf("%d个数据排序中...\n",n);
binInsertSort(a,n);
saveData(a,n,"out.txt");
printf("排序结束,排序结果保存在out.txt文件中。\n");
return 0;
}
Question three
#include "Arrayio.h"
#define N 10000
void shellSort(int a[],int n)
{
int i, j, d;
d = n/2;
while(d >= 1)
{
for(i = d + 1; i <= n; i++)
{
a[0] = a[i];
j = i - d;
while(j >= 1 && a[j] > a[0])
{
a[j + d] = a[j];
j = j - d;
}
a[j + d] = a[0];
}
d = d/2;
}
}
int main()
{
int a[N+1],n;
printf("数据初始化...\n");
n=readData(a,N,"data1.txt");
printf("%d个数据排序中...\n",n);
shellSort(a,n);
saveData(a,n,"out.txt");
printf("排序结束,排序结果保存在out.txt文件中。\n");
return 0;
}
Question four
#include "Arrayio.h"
#define N 10000
void selectSort(int a[],int n)
{
int i, j, min;
for(i = 1;i < n; i++)
{
min = i;
for(j = i + 1; j <= n; j++)
if(a[min] > a[j])
min = j;
if(min != i)
{
a[0] = a[i];
a[i] = a[min];
a[min] = a[0];
}
}
}
int main()
{
int a[N+1],n;
printf("数据初始化...\n");
n=readData(a,N,"data1.txt");
printf("%d个数据排序中...\n",n);
selectSort(a,n);
saveData(a,n,"out.txt");
printf("排序结束,排序结果保存在out.txt文件中。\n");
return 0;
}
Question five
#include "Arrayio.h"
#define N 10000
void sift(int a[],int k,int n)
{
int i,j,finished;
i=k;j=2*i;
a[0]=a[k];
finished=0;
while((j<=n)&&(!finished))
{
if((j<n)&&(a[j+1]>a[j]))
j++;
if(a[0]>=a[j])
finished=1;
else
{
a[i]=a[j];
i=j;j=2*j;
}
}
a[i]=a[0];
}
void heapSort(int a[],int n)
{
int i;
for (i=n/2;i>=1;i--)
sift(a,i,n);
for (i=n;i>1;i--)
{
a[0]=a[i];
a[i]=a[1];
a[1]=a[0];
sift(a,1,i-1);
}
}
int main()
{
int a[N+1],n;
printf("数据初始化...\n");
n=readData(a,N,"data1.txt");
printf("%d个数据排序中...\n",n);
heapSort(a,n);
saveData(a,n,"out.txt");
printf("排序结束,排序结果保存在out.txt文件中。\n");
return 0;
}
Question six
#include "Arrayio.h"
#define N 10000
void bubbleSort(int a[],int n)
{
int i, flag = 1;
while(flag == 1 && n > 1)
{
flag = 0;
for(i = 1; i < n; i++)
{
if(a[i] > a[i + 1])
{
a[0] = a[i];
a[i] = a[i + 1];
a[i + 1] = a[0];
flag = 1;
}
}
n--;
}
}
int main()
{
int a[N+1],n;
printf("数据初始化...\n");
n=readData(a,N,"data1.txt");
printf("%d个数据排序中...\n",n);
bubbleSort(a,n);
saveData(a,n,"out.txt");
printf("排序结束,排序结果保存在out.txt文件中。\n");
return 0;
}
Question seven
#include "Arrayio.h"
#define N 10000
void exchange(int *a, int *b)
{
int num;
num = *a;
*a = *b;
*b = num;
}
void quick_sort(int a[], int low, int high)
{
if( low >= high) return;
int i = low - 1, j = high + 1, x = a[(low + high)/2];
while(i < j)
{
do i++;while( a[i] < x);
do j--;while( a[j] > x);
if(i < j) exchange(&a[i], &a[j]);
}
quick_sort(a, low, j);
quick_sort(a, j+1, high);
}
int main()
{
int a[N+1],n;
printf("数据初始化...\n");
n=readData(a,N,"data1.txt");
printf("%d个数据排序中...\n",n);
quick_sort(a,1,n);
saveData(a,n,"out.txt");
printf("排序结束,排序结果保存在out.txt文件中。\n");
return 0;
}
Question eight
#include "Arrayio.h"
#define N 10000
void merge(int a[],int u,int m,int v)
{
int i,j,k,t;
int b[N+1];
i=u; j=m+1; k=u;
while (i<=m && j<=v)
{
if(a[i]<=b[j] )
{
b[k]=a[i];
i++;
}
else
{
b[k]=a[j];
j++;
}
k++;
}
if (i>m)
for (t=j;t<=v;t++)
b[k+t-j]=a[t];
else
for (t=i;t<=m;t++)
b[k+t-i]=a[t];
for (i=u;i<=v;i++)
a[i]=b[i];
}
int mergepass(int a[],int n,int len)
{
int i,t;
i=1;
while (i<=n-2*len+1)
{ merge(a,i,i+len-1,i+2*len-1);
i=i+2*len;
}
if (i+len-1<n)
merge(a,i,i+len-1,n);
}
void mergeSort(int a[],int n)
{ int len, b[N+1];
len=1;
while (len<n)
{ mergepass(a,n,len);
len=len*2;
}
}
void mergeSortdc(int a[],int low,int high)
{
int mid;
if (low<high)
{
mid=(low+high)/2;
mergeSortdc(a,low,mid);
mergeSortdc(a,mid+1,high);
merge(a,low,mid,high);
}
}
int main()
{
int a[N+1],n;
printf("数据初始化...\n");
n=readData(a,N,"data1.txt");
printf("%d个数据排序中...\n",n);
mergeSort(a,n);
saveData(a,n,"out.txt");
printf("排序结束,排序结果保存在out.txt文件中。\n");
return 0;
}
Question nine
#include "slnklist.h"
struct node2
{
linklist front,rear;
};
#define N 1000
void radixSort(linklist head)
{
struct node2 q[10];
linklist p,r;
int i,j,k,x;
for (j=0;j<10;j++)
q[j].rear=q[j].front=NULL;
for (i=0;i<6;i++)
{
p=head->next;
while (p)
{
head->next=p->next;
x=p->info;
for (j=0;j<i;j++)
x=x/10;
k=x%10;
if (q[k].front==NULL)
{
q[k].front=q[k].rear=p;
}
else
{
q[k].rear->next=p;
q[k].rear=p;
}
p=head->next;
}
r=head;
for (j=0;j<10;j++)
{
if (q[j].front!=NULL)
{ r->next=q[j].front;
r=q[j].rear;
q[j].front=q[j].rear=NULL;
}
}
r->next=NULL;
}
}
int main()
{
linklist head;
printf("数据初始化...\n");
head=creatLink("data1.txt",N);
printf("数据排序中...\n");
radixSort(head);
writetofile(head,"out.txt");
delList(head);
return 0;
}