//
//	pg. 137 
//	study of ADT - List array of items with variables length.
//	

#include <iostream>
using namespace std;

const int MAX = 50;

class List
{
	int data[MAX];	// can be different ex string
	int length;	// always int
public:
	List() { length = 0;	}
	int Length()
	{	return length;	}
	void Insert(int item)	//must match data type
	{	data[length] = item;
	length ++;
	}
	void Print() const
	{	for(int i=0; i<length; i++)
			cout << data[i] << " ";
		cout << "\n";
	}
	// sequential search pg 139 
	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"; // 4
	// Q: diplay the list?
	real.Print();

	//Q: try to find 77 in the list?
	
	if( real.IsPresent (77) )
		cout << " Found.\n";
	else
		cout << "Sorry.\n";
	return 0;
}