For problems where either pseudo-code or C++ code is required, you may simply include the algorithm written as pseudo-code without being tested as long as the logic is clear and can be easily understood by the grader

Implement the STL find routine that returns the iterator containing the first occurrence of x in the range that begins at start and extends up to, but not including end. If x is not found, end is returned. This is a nonclass (global function) with signature:

template

Iterator find(Iterator start, Iterator end, const Object& x)