• reverse() reverses the order of the elements inside the range [beg,end). • reverse_copy() reverses the order of the elements while copying them from the source range [sourceBeg,sourceEnd) to the destination range starting with destBeg. • reverse_copy() returns the position after the last copied element in the destination range (the first element that is not overwritten). • The caller must ensure that the destination range is big enough or that insert iterators are used. • Lists provide an equivalent member function, reverse(), which offers better performance be- cause it relinks pointers instead of assigning element values (see Section 8.8.1, page 423). • Complexity: linear (numElems/2 swaps or numElems assignments, respectively). The following program demonstrates how to use reverse() and reverse_copy