insertion_int.cpp

对随机生成的若干整数进行插入法排序

#include"sort.h"

void insertion_int()
{
	clock_t start, finish;
	double duration;
	FILE *fp,*fp1;
	fp = fopen("random_int.txt","r");
	fp1 = fopen("insert_sorted.txt","w");
	int* a = (int*)malloc(n*sizeof(int));
	int key;
	int i,j = 0;
	for(i=0; i<n; i++)
	{
		fscanf(fp,"%d",a+i);
	}

	start = clock();

	for(j=1; j<n; j++)
	{

		key = *(a+j);
		i = j-1;
		while(i>=0 && *(a+i)>key)
		{
			*(a+(i+1)) = *(a+i);
			i = i-1;
		}
		*(a+(i+1)) = key;
	}

	finish = clock();
	duration = (double)(finish - start) / CLOCKS_PER_SEC;

	fprintf(fp1,"Sort: %d,	Time:%f\n\n",n,duration);
	for(i=0; i<n; i++)
	{
		fprintf(fp1,"%d",*(a+i));
		fputc('\n',fp1);
	}
	fclose(fp);
	fclose(fp1);
	free(a);
}