// THERE IS A BUG IN THIS EXAMPLE:

//  Example 6.11, page 165
//  Schaum's Outline of Programming with C++ by John R. Hubbard
//  Copyright McGraw-Hill, 1996

using namespace std;
#include <iostream>


short* loc(short* a1, short* a2, int n1, int n2) 
{
  short* end1 = a1 + n1;
  for (short* p1 = a1; p1 < end1; p1++)
    if (*p1 == *a2) {
      int j;
      for (j = 0; j < n2; j++) {
        if (p1[j] != a2[j]) break;
cout << "p[j]= " << p1[j] << endl;
      }
      if (j == n2) return p1;
    }
  return 0;
}

int main()
{
//    short a1[9] = {11, 11, 11, 11, 11, 22, 33, 44, 55};
//    short a2[5] = {11, 11, 11, 22, 33};
  
  short a1[9] = {11, 11, 11, 11, 11, 22, 33, 44, 55};
  short a2[5] = {22, 33, 44, 55 ,66};

a1[9]=66;  
//  Added to simulate the situation in which the location following 
//  the last location of array a1 contains an "acceptable" value;
 
  cout << "Array a1 begins at location\t" << a1 << endl;
  cout << "Array a2 begins at location\t" << a2 << endl;
  short* p = loc(a1, a2, 9, 5);
  if (p) {
    cout << "Array a2 found at location\t" << p << endl;
    for (int i = 0; i < 5; i++)
      cout << "\t" << &p[i] << ": " << p[i]
           << "\t" << &a2[i] << ": " << a2[i] << endl;
  }
  else cout << "Not found.\n";
  return 0;
}