Question

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 non-class (global function) with signature
template <typename Iterator, typename object>
Iterator my_find(Iterator start, iterator end, const object & x);
Q1 Deliverable: Submit the code for the routine in a file titled HW2Q1.cc

Answer 1

Here is the completed code for this problem. Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. If you are satisfied with the solution, please rate the answer. Thanks

//required method

template <typename Iterator, typename object>

Iterator my_find(Iterator start, Iterator end, const object & x){

                //looping until start and end are same, assuming start is always before end

                while(start!=end){

                                //checking if element correspond to current iterator position is same as x

                                if(*start==x){

                                                //found, returning start

                                                return start;

                                }

                                //otherwise advancing start

                                start++;

                }             

                //if not found, returning end

                return end;

}