//
//		page 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;
public:
	List(){ length = 0;	}
	int Length()
	{	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 , primary search page 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;

	// Q: 14 10 3 7
	
	real.Insert(14);
	real.Insert(10);
	real.Insert(3);
	real.Insert(7);
	
	cout << real.Length() << "\n"; // 4
	//Q: display the list?
	real.Print();

	// Q: try to find 77 in the list? if not in last tell user.

	if (real.IsPresent(77))
		cout << " Found 77 in the list" << "\n";
			else
		cout << " 77 is not in the list, Sorry. " << "\n";

	return 0;
}