Fill in the blanks in each of the following statements:
a) As long as a container’s (or built-in array’s) _____ satisfy the requirements of an algorithm, the algorithm can work on the container.
b) Algorithms generate and generate_n use a(n) _____ function to create values for every element in a range of container elements. That type of function takes no arguments and returns a value that can be placed in an element of the container.
c) Pointers into built-in arrays are _____ iterators.
d) Use the _____ algorithm (the template of which is in header
) to sum the values in a range. e) Use the _____ algorithm to apply a general function to every element in a range when you need to modify those elements.
f) In order to work properly, the binary_search algorithm requires that the sequence of values must be _____.
g) Use the function iter_swap to exchange the elements that are pointed to by two _____ iterators and exchanges the values in those elements.
h) C++ 11 now includes the minmax algorithm that receives two items and returns a(n) _____ in which the smaller item is stored in first and the larger item is stored in second.
i) _____ algorithms modify the containers they operate on.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.