Lecture 16


Learning Outcomes

At the end of this lecture, you’ll be able to:

Lecture Plan

In this lecture, we'll cover the following lessons:

  1. Set ADT: The Interface
  2. Linked Implementation of Set
  3. LinkedSet
  4. Hacking the O(n) Find
  5. Array Implementation of Set
  6. ArraySet
  7. Hacking the O(n) Find
  8. Set Iterator
  9. Fail-Fast Iterators
  10. Ordered Set: The Interface
  11. Linked Implementation of OrderedSet
  12. Array Implementation of OrderedSet
  13. Set-theoretical Operations

Lessons marked with ⚡ contain exercise/activity.