English subtitles

← 04-10 Representing State Solution

dummy description

Get Embed Code
1 Language

Showing Revision 1 created 05/06/2012 by Amara Bot.

  1. The answer that all four of these representations would be fine.
  2. We can generate successors by appending or adding elements
  3. to set lists, tuples, or frozen sets.
  4. None of those is too hard to do. It's a little bit easier with sets than with the other ones.
  5. In terms of hashing, the immutable data types--frozen sets and tuple--
  6. are hashable, and the mutable types--list and set--are not hashable.