STL iterators: container.end()?

The C++ memory model guarantees that you can always form a pointer to the element after the last element of an array. If there is none, either the system won't let you allocate an object at this location or it would wrap around. Also, note that this is a potential problem for arrays as other containers can use iterator types which deal with the past the end position in some other suitable form: they fully control how the increment operation work.

An end iterator (at least figuratively) points just past the end of the container. The valid items in the container go from *container.begin() through *container.end()-1.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.