Generate subset of a vector

subsetperm.cpp

#include <vector>
#include <iostream>
#include <algorithm>

using std::cout;
using std::vector;

template <typename T> void printvec(const vector<T> &vec) {
    cout << "{";
    for (const auto &v : vec) {
        cout << v << ",";
    }
    cout << "}\n";
}

int main(int argc, char const *argv[]) {
    // calculate all subsets of a vector
    vector<uint8_t> set{4, 5, 7, 9, 12, 19, 23};
    vector<uint8_t> bitset(set.size());
    for (int i = 0; i <= set.size(); i++) {
        vector<int> subset(i);
        vector<int> subset_comp(set.size() - i);
        std::fill(bitset.begin(), bitset.begin() + i, 1);
        std::fill(bitset.begin() + i, bitset.end(), 0);
        do {
            int subset_count = 0;
            int subsetcomp_count = 0;
            for (int k = 0; k < bitset.size(); k++) {
                if (bitset[k]) {
                    subset[subset_count] = set[k];
                    subset_count++;
                } else {
                    subset_comp[subsetcomp_count] = set[k];
                    subsetcomp_count++;
                }
            }
            printvec<int>(subset);
        } while (std::prev_permutation(bitset.begin(), bitset.end()));
    }
    return 0;
}