采用位运算实现高效的生成子集算法

#include <stdio.h>
#include <string.h>
#include <math.h>

/* 这里假设存在字母集合 */
char set[] = {'a','b','c','d','e','f','g','h','i','j','k','l','m',
     'n','o','p','q','r','s','t','u','v','w','x','y','z'};

/* 参考<<高效程序的奥秘>>一书生成下一个相同数目的1位的更大数 */

unsigned snoob (unsigned x)
{
 unsigned smallest,ripple,ones;
 smallest = x&-x;
 ripple = x+smallest;
 ones = x^ripple;
 ones = (ones>>2) /smallest ;
 return ripple | ones;
}

/* 找出后置0的个数 用于确定子集元素下标 */
int ntz(unsigned x)
{
 int n ;
 if (x==0) return 32;
 n = 1;
 if ((x & 0x0000FFFF)==0) {n=n+16;x=x>>16;}
 if ((x & 0x000000FF)==0) {n=n+8;x=x>>8;}
 if ((x & 0x0000000F)==0) {n=n+4;x=x>>4;}
 if ((x & 0x00000003)==0) {n=n+2;x=x>>2;}
 return n-(x&1);
}

/* 依次输出子集元素 */
void unsigned output(unsigned x)
{
 int t ;
 printf("{");
 while(x!=0)
 {
  t=x&-x;
  printf("%c ",set[ntz(t-1)]);
  x=x&~t;
 }
 printf("}/n");
}

void main()
{
 unsigned int x=1;
 unsigned int i,j;
 unsigned int n=26;

/* 循环生成,由只有一个元素的子集开始 */
 for (i=1,j=1;j<=n;i+=pow(2,j))
 {
  while (true)
  {
  
   if (x==0||x>pow(2,n+1))break;
   output(x);
   x=snoob(x);
  }
 }
}