Computer Science A - found - 9/10/99

Directions:
    Write an efficient boolean function whose value is true if and
    only if there is an integer found in two separate lists
    (vectors). False otherwise. Assume the two lists are in strictly
    increasing order (g[0] < g[1] < ... < g[N - 1]) and that both
    lists are full.

Declarations:
    const int N = <some integer>;
    apvector<int> g(N), h(N);

Call:
    cout<<found(g, h, N)<<endl;

Code:
    bool found(const apvector<int>& g, const apvector<int>& h, int N)
    {
        int gLCV = 0,
            hLCV = 0;

        do
        {
            if(g[gLCV] == h[hLCV])
                return true;
            else if(g[gLCV] < h[hLCV])
                gLCV++;
            else
                hLCV++;
        } while(gLCV < N && hLCV < N);

        return false;
    }