computer findGoodComputer( int N, computers C[N] ) { 
  computerList buckets[log2(N)]; 
  int discards; 
  int i; 
  int curBucket = 0; 
  int maxBucket = 0; 
   
  // All individual computers go into bucket 0. 
  for( i=0; i < N; i++ ) 
   Buckets[0].add( C[i] ); 
   
  // We only store the leader in the bucket. None of the other 
  // computers matter. 
  while ( exp(2, maxBucket + 1) < N - discards ) { 
   while( buckets[curBucket].size() <= 1 ) 
    curBucket--; // find a bucket with at least 2 groups 
   if ( buckets[curBucket].computer(1).test( buckets[curBucket].computer(2) ) == GOOD ) { 
    buckets[curBucket + 1].add( buckets[curBucket].computer(2) ); 
    buckets[curBucket].remove(2); 
    buckets[curBucket].remove(1); 
    maxBucket = max( ++curBucket, maxBucket ); 
   } else { 
    discards += exp(2, curBucket + 1); 
    buckets[curBucket].remove(2); 
    buckets[curBucket].remove(1); 
   } 
  } 
  return Buckets[maxBucket].computer(1); 
 }