An STL algorithm cannot:
A) Return an iterator.
B) Take two iterators as arguments to specify a range.
C) Access STL members directly.
D) Be used with containers that support more powerful iterators than the minimum requirements for the algorithm.

Question

Quizplus · Accepted Answer

STL algorithms are designed to be independent of any specific container implementation. They work only through iterators, and never directly access any member of a container class. Accessing STL members directly would violate the principles of encapsulation and abstraction that are fundamental to the design of STL.

An STL Algorithm Cannot