//
//	p. 137
//	ADT- List : arrays of items w. var. length
//

#include <iostream>
using namespace std;

const int MAX = 50;

class List
{
	int data[MAX];
	int length;
public:
	List()  { length = 0; }
	int Length() const
	{	return length;  }
	void  Insert(int item)
	{	data[length] = item;
		length ++;
	}
	void Print() const
	{	for(int i=0; i<length; i ++)
			cout << data[i] << "  ";
			cout << "\n";
	}
	// sequential search, p. 139
	bool IsPresent(int item) 
	{	bool found = false;
		for(int i=0; i<length && !found; i++)
		if(data[i] == item) found = true;
	return found;
	}
};

int main()
{
	List real;
	// 14 10 3 7?
	real.Insert(14);
	real.Insert(10);
	real.Insert(3);
	real.Insert(7);
	
	cout << real.Length() << "\n"; // 4
	real.Print();

	// Q. Try to find 77 in the list?
	if(real.IsPresent(77)) cout << "77 is in the list.\n";
	else			cout << "Sorry. 77 is not in the list.\n";

	return 0;
}