• Returns the position after the last transformed element in the destination range (the first element that is not overwritten with a result). • The caller must ensure that the destination range is big enough or that insert iterators are used. • sourceBeg and destBeg maybe identical. Thus, as with for_each(), youcan usethis algorithm to modify elements inside a sequence. See the comparison with the for_each() algorithm (Section 11.2.2, page 509) for this kind of use. • To replace elements matching a criterion with a particular value, use the replace() algorithms (see Section 11.6.6, page 571). • Complexity: linear (numElems calls of op()). The following program demonstrates how to use this kind of transform