非常无聊——STD::sort VS 基数排序

  1 #include <cmath>
  2 #include <iostream>
  3 #include <cstdio>
  4 #include <cstdlib>
  5 
  6 using namespace std;
  7 struct num
  8 {
  9     int data;
 10     num* next;
 11 }nu[100000000];
 12 
 13 void plu(num *f,num *b)
 14 {
 15     f->next=b;
 16 }
 17 
 18 num* t[100000];
 19 num* e[100000];
 20 void add(int pos,num* l)
 21 {
 22     if (e[pos])
 23     {
 24         e[pos]->next=l;
 25         e[pos]=l;
 26     }
 27     else
 28     {
 29         t[pos]=l;
 30         e[pos]=l;
 31     }
 32 }
 33 
 34 int predo()
 35 {
 36     int n,ret=0;
 37     scanf("%d",&n);
 38     for (int i=1;i<=n;++i)
 39     {
 40         int j;
 41         scanf("%d",&j);
 42         nu[i].data=j;
 43         nu[i].next=nu+i+1;
 44         if (i==n) nu[i].next=NULL;
 45         ret=max(ret,j);
 46     }
 47     return ret;
 48 }
 49 num* root=nu+1;
 50 
 51 void JSsort(int n)
 52 {
 53     for (num* now=root;now;)
 54     {
 55         num* nex=now->next;
 56         now->next=NULL;
 57         int tt=now->data%n;
 58         add(tt,now);
 59         now=nex;
 60     }
 61     num* last=NULL;
 62     for (int i=0;i<n;++i)
 63     {
 64         if (t[i])
 65         {
 66             if (!last)
 67             {
 68                 root=t[i];
 69             }
 70             else
 71             {
 72                 last->next=t[i];
 73             }
 74             for (num *now=t[i];now;now=now->next)
 75                 last=now;
 76         }
 77         t[i]=e[i]=NULL;
 78     }
 79     for (num* now=root;now;)
 80     {
 81         num* nex=now->next;
 82         now->next=NULL;
 83         int tt=now->data/n;
 84         add(tt,now);
 85         now=nex;
 86     }
 87     last=NULL;
 88     for (int i=0;i<n;++i)
 89     {
 90         if (t[i])
 91         {
 92             if (!last)
 93             {
 94                 root=t[i];
 95             }
 96             else
 97             {
 98                 last->next=t[i];
 99             }
100             for (num *now=t[i];now;now=now->next)
101                 last=now;
102         }
103     }
104     return;
105 }
106 
107 void print()
108 {
109     for (num* now=root;now;now=now->next)
110     {
111         printf("%d ",now->data);
112     }
113     printf("\n");
114     return;
115 }
116 
117 int main()
118 {
119     freopen ("sort.in","r",stdin);
120     freopen ("sort.out","w",stdout);    
121     int k=predo();
122     JSsort(sqrt(k)+1);
123     print();
124     return 0;
125 }