Figured out how to generate a list of all k-element combinations from a set of n elements using double recursion. Apparently, the solution I developed is the “classical” way to do it, but it was challenging nevertheless.