Cracking the Oyster(Column 1 of Programming Pearls)

 1 int intcomp(int *x, int *y)

 2 { 

 3   return *x - *y; 

 4 }

 5 

 6 int a[1000000];

 7 int main(void)

 8 { 

 9   int i, n=0;

   while (scanf("%d", &a[n]) != EOF)

   n++;

   qsort(a, n, sizeof(int), intcomp);

   for (i = 0; i < n; i++)

   printf("%d\n", a[i]);

   return 0;

 }

 

 1 int main(void)
 2 { 
 3   set S;
 4   int i;
 5   set::iterator j;
 6   while (cin >> i)
 7     S.insert(i);
 8   for (j = S.begin(); j != S.end(); ++j)
 9     cout << *j << "\n";
10   return 0;
11 }

 

 

 #define BITSPERWORD 32
2 #define SHIFT 5
3 #define MASK 0x1F
4 #define N 10000000
5 int a[1 + N/BITSPERWORD];
6 void set(int i) { a[i>>SHIFT] |= (1<<(i & MASK)); }
7 void clr(int i) { a[i>>SHIFT] &= ~(1<<(i & MASK)); }
8 int test(int i){ return a[i>>SHIFT] & (1<<(i & MASK)); }