由上述例子可以推出n个元素k个分量的所有组合的减治算法,开始对k个分量进行i=2个元素的组合,然后每一步增加一个分量,做i+1个分量的组合,直到元素个数为n,此时得出k个元素的所有组合了。
C++代码:
#include <iostream>
#include <vector>
using namespace std;
int C( int n, int m)
{
if ( n == 0 )
return 1;
int res = 1;
int temp = m - n;
for( int i = m; i != temp; --i )
res *= i;
for( int j = n; j > 1; --j )
res /= j;
return res;
}
int main()
{
const int N = 6;
int Array[] = { 1, 2, 3, 4, 5, 6 };
//cout << "Please enter the array" << endl;
//for (int i1 = 0; i1 < N; cin >> Array[i1++]);
//for( int a = 0; a < N; ++a )
//cout << Array[a] << endl;
cout << "Please input K" << endl;
int K;
cin >> K;
int num = N - K + 1;
vector< vector< int > > vec( num ), ivec; //K个元素子集的个数
vector< vector< int > >::iterator it = vec.begin();
for( int i = K - 1; i < N; ++i, ++it ) //先存储第一列数
{
( *it ).push_back( Array[i] );
}
cout << vec.size() << endl;
for( int i1 = 1; i1 < K; ++i1 ) //i1为子集里元素的个数
{
int keyNum = K - i1 - 1;
vector< vector<int> >::iterator old_begin = vec.begin(),
old_end = vec.end();
int index = 0;//辅助控制需要添加新元素的位置
for( int i2 = 0; keyNum < N - i1; ++keyNum, i2 += C( i1 - 1, N - keyNum - 1 ))
{
old_begin = vec.begin() + i2;
copy( old_begin, old_end, back_inserter( ivec ) );
for( vector< vector< int > >::iterator beg = ivec.begin() + index; beg != ivec.end(); ++beg )
{
beg->push_back( Array[keyNum] );
}
index += old_end - old_begin;
}
vec.clear();
copy( ivec.begin(), ivec.end(), back_inserter( vec ) );
ivec.clear();
}
cout << "Here is the result !" << endl;
cout << "There are "
<< vec.size()
<< " subarray"
<< endl;
for( vector< vector<int> >::iterator it = vec.begin(); it != vec.end(); ++it )
{
for( vector<int>::reverse_iterator it1 = (*it).rbegin(); it1 != (*it).rend(); ++it1 )
cout << *it1;
( it + 1 - vec.begin()) % 10 ? cout << " " : cout << endl;
}
return 0;
}