//	pg 137
//	ADT - lists: array of items with variable length
//

#include <iostream>
using namespace std;

const int MAX = 50;

class List
{
	int data[MAX];
	int length;		// length is always int.
public:
	List() { length = 0;	}
	int Length()		// could put const here but don't have to.
	{	return length;	}
	void Insert(int item)
	{	data[length] = item;
		length ++;		// transformer insert.
	}
	void Print() const
	{	for(int i=0; i<length; i++)
			cout << data[i] << " ";
		cout << "\n";
	}
	// sequential search pg 139. - primary search method
	bool IsPresent(int item) const
	{	bool found = false;
		for(int i=0; i<length && !found; i++)
			if(data[i] == item) found = true;
		return found;
	}
};

int main()
{
	List real;

	cout << real.Length() << "\n";	// should be zero, because real goes back to constructor.

	return 0;
}