Checking membership

• A

  Each check goes from scanning the list to a single hash lookup

• B

  The checks return different results, since a set removes duplicates

• C

  Memory use falls, since a set stores less per element

• D

  The checks become ordered, so early matches are found sooner