Generating All k-Subsets of \(\{1 \ldots n\}\) with Minimal Changes

Abstract

An algorithm is given to generate all \(k\)-subsets of \(\{1, \ldots, n\}\) as increasing sequences, in an order so that going from one sequence to the next, exactly one entry is changed by at most \(2\).