6666
#include <stdio.h>
#include <stdlib.h>
typedef struct student{
int id;
char name[20];
int age;
int k;
}Stu;
Stu p[1000];
void Merge(Stu *q,int star,int mid,int cont)
{
int i=star,j=mid+1,k=0;
q=(Stu *)malloc((cont-star+1)*sizeof(Stu));
if(!q)
{
return;
}
while(i<=mid&&j<=cont)
{
q[k++]=(p[i].id<=p[j].id)?p[i++]:p[j++];
}
while(i<=mid)
{
q[k++]=p[i++];
}
while(j<=cont)
{
q[k++]=p[j++];
}
for(k=0,i=star;i<=cont;k++,i++)
{
p[i]=q[k];
}
}
void MergeSort1(Stu *p,int star,int cont)
{
int mid;
if(star<cont)
{
mid=(star+cont)/2;
MergeSort1(p,star,mid);
MergeSort1(p,mid+1,cont);
Merge(p,star,mid,cont);
}
}
void MergeSort(Stu *p,int cont)
{
int star=0;
MergeSort1(p,star,cont);
}
int main()
{
FILE *fp1;
int cont=0,i,cont1;
fp1=fopen("c://daolu2.txt","r");
while(!feof(fp1))
{
fscanf(fp1,"%d %s %d %d", &p[cont].id,p[cont].name,&p[cont].age,&p[cont].k);
cont++;
}
fclose(fp1);
cont1=cont;
cont=cont-1;
MergeSort(p,cont);
for(i=0;i<cont1;i++)
{
printf("%d %s %d %d\n",p[i].id,p[i].name,p[i].age,p[i].k);
}
fp1=fopen("c://daolu3.txt","w");
for(i=0;i<cont1;i++)
{
fprintf(fp1,"%d %s %d %d\n", p[i].id,p[i].name,p[i].age,p[i].k);
}
fclose(fp1);
return 0;
}
6666
#include <stdio.h>
#include <stdlib.h>
#include<time.h>
typedef struct student{
int dataSize;
int linkID;
char roadSize[2];
char roadMessage[4];
char roadName[100];
}mapMessage;
mapMessage p[1000],q;
double select(mapMessage *p,int cont)
{
double start,end1,sum;
mapMessage q;
int i,j;
start=clock();
for(i=0;i<cont;i++)
{
for(j=i+1;j<cont;j++)
{
if(p[i].linkID>p[j].linkID)
{
q=p[i];
p[i]=p[j];
p[j]=q;
}
}
}
end1=clock();
sum=end1-start;
return sum;
}
int main()
{
FILE *fp1;
int cont=0,i;
fp1=fopen("c://daolu.txt","r");
while(!feof(fp1))
{
fscanf(fp1,"%d %d %s %s %s", &p[cont].dataSize,&p[cont].linkID,p[cont].roadSize,p[cont].roadMessage,p[cont].roadName);
cont++;
}
fclose(fp1);
select( p,cont);//选择排序
fp1=fopen("c://daolu1.txt","w");
for(i=0;i<cont;i++)
{
fprintf(fp1,"%d %d %s %s %s\n", p[i].dataSize,p[i].linkID,p[i].roadSize,p[i].roadMessage,p[i].roadName);
}
fclose(fp1);
return 0;
}