排序

本帖最后由 Micropoor 于 2011-12-26 12:31 编辑

<?php

// 创建一亿个QQ号的txt (大约需85~100秒)

set_time_limit(0);
$fn = 'qq.txt';
$fp = fopen($fn, 'w');

$st = microtime(true);

$l = range(0,10000);
shuffle($l);
foreach ($l as $k=>$v)
{
    $arr = range($v*10000+10000,10000*($v+1)+9999);
    shuffle($arr);
    fputs($fp,implode("\n", $arr)."\n");
    unset($arr);
}

echo  microtime(true)-$st;

?>

<?php

// 长度号码分类 (大约需360~400秒)

set_time_limit(0);
$st = microtime(true);

if(!is_dir('qq_no')) mkdir('qq_no');
$file = fopen('qq.txt', 'r'); 


$i=0;
$end_s = '';
while(!feof($file))
{
    $g = 1042*1024;
    fseek($file,$g*$i);
    $s = fread($file, $g);

     
    $end = strrpos($s, "\n");
    $arr_s = $end_s.substr($s, 0, $end);
    $end_s = substr($s, $end);

    $arr = explode("\n", $arr_s);
    foreach ($arr as $k=>$v)
    {
        if($v!='')
        {
            $tag = "$v[0]$v[1]$v[2]";
            $text_arr[strlen($v)][$tag][] = $v;
        }
    }

    foreach ($text_arr as $k=>$v)
    {
        $n_dir = 'qq_no/'.$k;
        if (!is_dir($n_dir)) mkdir($n_dir);
        foreach ($v as $tag=>$val)
        {
            $n_tf = fopen($n_dir.'/'.$tag.'.txt', 'a+');
            fputs($n_tf,implode("\n",$val)."\n");
        }
        
        
    }
    unset($text_arr);

    ++$i;

}

echo  microtime(true)-$st;

?>

<?php

// 排序完成拉 (800~920秒)

set_time_limit(0);
$st = microtime(true);

$qq_done = fopen('qq_done.txt', 'a+');

$root = 'qq_no';
$dir_array = scandir($root);

foreach ($dir_array as $key=>$val)
{
    if ($val != '.' && $val != '..')
        $dirs[$val] =  scandir($root.'/'.$val);
}


foreach ($dirs as $key=>$val)
{
    foreach ($val as $v)
    {
        if ($v != '.' && $v != '..')
        {
            $file = $root. '/' . $key . '/'. $v;
            $c = file_get_contents($file);
            $arr = explode("\n", $c);
            sort($arr);
            fputs($qq_done, implode("\n",$arr));
            unlink($file);
        }
    }
    rmdir($root. '/' . $key);
}
rmdir($root);

echo  microtime(true)-$st;

?>

C:



#include <stdio.h>

#define BITSPERWORD 32
#define SHIFT 5
#define MASK 0x1F
#define N 100000000

int a[1 + N/BITSPERWORD];

void set(int i)
{
    a[i>>SHIFT] |= (1<<(i & MASK)); //i&MASK相当于1&(32-1),即1%32
}

void clr(int i)
{
    a[i>>SHIFT] &= ~(1<<(i & MASK));
}

int test(int i)
{
    return a[i>>SHIFT] & (1<<(i & MASK));
}

int main()
{
    int i;
    //初始化
    for(i = 0; i < N; i++)
        clr(i);

    //读取文件,置位
    while(scanf("%d", &i) != EOF)
        set(i);

    for(i = 0; i < N; i++)
        if(test(i))
            printf("%d\n", i);

    return 0;
}



ubuntu linux下gcc编译



#include <stdio.h>             
#include <stdlib.h>            
#define MAX 100009999          
#define SHIFT 5                
#define MASK 0x1F              
#define DIGITS 32              
int a[1+MAX/DIGITS];           

void set(int n)      
{
    a[n>>SHIFT]=a[n>>SHIFT]|(1<<(n&MASK));     
}                                              

void clear(int n)              
{
    a[n>>SHIFT]=a[n>>SHIFT]&(~(1<<(n&MASK)));   
}

int test(int n)                
{
    return a[n>>SHIFT] & (1<<(n&MASK));        
}

int main(int argc, char *argv[])
{
    int i;                     
    int  tp;                                                                                                                                                  


FILE *ip;
FILE *op;
for(i=1;i<=MAX;i++)
{
clear(i);
}
ip = fopen("qq_before_sort.txt","r");
while( !feof(ip) )
{
fscanf(ip,"%d\n",&tp);
set(tp);
}
fclose(ip);
op = fopen("qq_after_sort.txt","w");
for(i=1;i<=MAX;i++)
{
if(test(i)){
fprintf(op, "%d\n",i);
}
}
fclose(op);
return 0;
}

{:4_55:}审核代码容易 写代码难 顶缘董

其实我想说,这帖已存在于CSDN。

其实我想哭。。。找遍了天下终于在家门口找到了