Technical Discussion :: C++
Home > Technical Interview Q&A > C++ > Discussion
134 / 187
Define Non-modifying sequence algorithm?
Answer:
These algorithms are provided to do the most common forms of updates. Some update a sequence while others produce a new sequence based on information found during a traversal.
Std. algorithm work on data structures thru Iterators. This implies that inserting a new element into a container (or) deleting one is not easy.
Asked In ::
Amit
23 Feb, 2019 5:07 AM
These algorithms are provided to do the most common forms of updates. Some update a sequence while others produce a new sequence based on information found during a traversal.
Std. algorithm work on data structures thru Iterators. This implies that inserting a new element into a container (or) deleting one is not easy.
Std. algorithm work on data structures thru Iterators. This implies that inserting a new element into a container (or) deleting one is not easy.