anonymous
  • anonymous
I am having trouble generating all the possible sub-multisets of the letters in a hand for problem#4 in ps6. Can anyone give me a hint?
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
If there are n letters in your hand there will be 2**n subsets. Half of them will include the first letter, the other half will omit it (and so on for all letters.) So one way is to create a recursive function which will generate all the subsets starting using letters from 0..k given a list of the subsets using letters from 0..k-1. At the bottom of your recursion, the subsets from 0..0 are "" and hand[0] (either the empty string or a string with the first letter.) Given the list of subsets using letters from 0..k-1, the sets from 0..k will be the same list of sets, and the same sets with the k-th letter added to each one. Alternately, you can do this completely iteratively by stepping through the 2**n possibilities as in subsets = [ ] for k in range(2**n): this_subset = "" Then decide that the j-th letter will be included in this k-th subset only if the j-th bit is set in the binary form of the number k. You can test this with if (k & (1<
anonymous
  • anonymous
Wow that really helps a lot!! Thanks so much!!

Looking for something else?

Not the answer you are looking for? Search for more explanations.