//	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;
	// 14, 10, 3, 7

	real.Insert(14);
	real.Insert(10);
	real.Insert(3);
	real.Insert(7);

	cout << real.Length() << "\n";	// should be 4.

	// Q: display the list?

	real.Print();

	// Q: try to find 77 in the list or not?
	if(real.IsPresent(77))
		cout << "Found.\n";
	else
		cout << "Not there.\n";

	return 0;
}