A simple systolic algorithm for generating combinations in lexicographic order

AbstractA systolic algorithm is described for generating, in lexicographically ascending order, all combinations of m objects chosen from {1,…, n}. The algorithm is designed to be executed on a linear array of m processors, each having constant size memory, and each being responsible for producing one element of a given combination. There is a constant delay per combination, leading to an O(C(m, n)) time solution, where C(m,n) is the total number of combinations. The algorithm is cost optimal (assuming the time to output the combinations is counted), does not deal with very large integers, and is much simpler than the previously known solutions that enjoy same properties