izualzhy — Tue, 20 Mar 2012 12:04:00 GMT

题目��׃��多说了，开��第一个题目�?/p>

大意��是在给定内�?.25M以内�Q�给最多包含n个正整数的文件数据排序的问题�Q�n=10^7

首先是生成一个该文�g的问题，�c�M��于洗牌算法得��C��l�随��Z��重复的数字�?/p>

/*
 * =====================================================================================
 *       Filename:  creatDataFile.c
 *    Description:  create random digital repeatable data
 *        Created:  03/17/2012 01:11:38 AM
 *       Compiler:  gcc
 *
 *         Author:  zhy (), izualzhy@163.com
 *        Company:  
 * =====================================================================================
 */

#include 
#include 
#include 

#define N 100/*00000*/
#define k 10/*00000*/

int main()
{
    unsigned int i = 0;
    srand(time(NULL));
    unsigned int *array = (unsigned int*)malloc(sizeof(unsigned int)*N);

    for ( i=0; iarray[i] = i;


    for ( i=0; iunsigned temp = array[i];
        unsigned randomIndex = rand()%(N-i)+i;
        array[i] = array[randomIndex];
        array[randomIndex] = temp;
    }

    FILE* fp;
    fp = fopen("data","w+");
    for ( i=0; i"%d\n",array[i]);
    free(array);

    return 0;
}

代码里N即�ؓ数字可能的最大��|��k为生成的个数。�ؓ了方便表�C�结果，N=100�Q�k=10�Q?/p>

生成的data数据�Q?/p>

79
93
83
16
29
9
80
3
5
15

接下来就是位图表�C��ƈ排序�?/p>

/*
 * =====================================================================================
 *       Filename:  sortDataByBitMap.c
 *        Created:  03/20/2012 12:17:46 PM
 *       Compiler:  gcc
 *
 *         Author:  zhy (), izualzhy@163.com
 *        Company:  
 * =====================================================================================
 */

#include 
#include 

#define N 100/*00000*/
#define k 10/*00000*/

#define BITSPERWORD 32

int main()
{
    int array[N/BITSPERWORD+1];
    memset(array,0,sizeof(array));

    FILE* fp = fopen("data","r");
    unsigned int ui,i=0;
    for( i=0; i"%d",&ui);
        if ((array[ui/BITSPERWORD]>>(ui%BITSPERWORD) & 1) == 1)
            printf("digits repeated!?\n");
        else
            array[ui/BITSPERWORD] |= 1<"sortdata","w");
    int j = 0;
    for ( i=0; iif ((array[i/BITSPERWORD]>>i%BITSPERWORD & 1)==1) {
            fprintf(fp,"%d\n",i);
            ++j;
        }
    fclose(fp);

    return 0;
}

注意N�Q�k与前一个要一致�?/p>

sortData内容�Q?/p>

3
5
9
15
16
29
79
80
83
93

izualzhy 2012-03-20 20:04 发表评论

久久久久亚洲av综合波多野结衣,久久综合亚洲色一区二区三区,26uuu久久五月天