Adrian Lita

Generating all combinations of a string using the binary counter method

By: Adrian Lita

Published on: 2018-06-26

Keywords: #combinations #string #strings #binary-counter #academic #snippet #counter


Generating all k-combinations of n elements can be done in various ways. Here I'm preseting to you, for academic purpose, the binary counter method. First of all, let's calculate how many k-combinations of n exists: /* Calculates kCn kCn = n!/(k! * (n-k)!) */ unsigned int total_combinations(int n, int k) { //error if (k > n) { return 0; } unsigned int c = 1; //final result //check which one is greater,...

Read More >