Difference between revisions of "TADM2E 7.18"
From Algorithm Wiki
(Blanked the page) |
|||
| Line 1: | Line 1: | ||
| + | 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. | ||
Latest revision as of 14:45, 23 July 2020
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.
