组合算法 C++高效实现 (二进制辅助法)(2)

for(int i = 0; i < total; ++i){
  if((index>>i)&1 == 1){
   cout << t[i] << " ";
  }
 }
 cout << endl;
}

void combination(int t[],int count){
 for(int i = 0; i < (1<<count); ++i){
  printEachResult(t, i, count);
 }
}

int _tmain(int argc, _TCHAR* argv[])
{
 const int N = 3;
 int t[N] = {1, 2, 3};
 combination(t,N);
 system("pause");
 return 0;
}