TADM2E 7.18

From Algorithm Wiki
Revision as of 14:45, 23 July 2020 by Matt (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

This question is asking you to enumerate all the subsets of n elements in the gray code order.

Gray code order is an order to enumerate all the subsets of a set such that you only need to either insert one element or remove one from the previous subset to get the new subset. The detail of gray code ordering is given in chapter 14.5 of the book.