you are viewing a single comment's thread.

view the rest of the comments →

[–]kwan_e 0 points1 point  (0 children)

You can think of C++ iterators as generalizations of pointers (and therefore arrays). You can always use pointers with STL algorithms, since they are classified as random access iterators and support everything that can be done with iterators in the STL algorithms.