Set Iterator
We know set is an unordered collection.
Exercise How should we implement the iterator for Set ADT?
A) Iterate in the same order the elements have been added.
B) Iterate in the order that corresponds to the natural ordering of the elements (e.g., smallest first, largest last).
C) To ensure this is an unordered collection, we must iterate over the elements in a random order.
D) Iterate over the elements from head to tail in LinkSet and from index 0 to numElements - 1 in ArraySet.
Solution
The correct answer is D. It is the cheapest strategy.
The statement that "set is an unordered collection" implies that a client shall not expect the iteration is done in any particular order. We don't need to go out of our way to ensure an un-orderly iteration!