// Page 180-182

import java.util.Scanner;
public class SortedList
{
	final int MAX = 50;
	private int[] data = new int[MAX];
	private int length;
	public SortedList()
	{
		length  = 0;
	}
	public int Length()
	{
		return length;
	}
	public boolean IsEmpty ()
	{
		return length == 0;
	}
	public boolean IsPresent (int item)
	{
		int position = posBinarySearch(item);
		if (position<0)
			return false;
		else
			return true;
	}
	public void Print ()
	{
		for (int k=0; k<length; k++)
			System.out.print(data[k] + " ");
		System.out.println();
	}
	public void Insert (int item)
	{
		data[length] = item;
		length ++;
	}
	private int posBinarySearch (int item)
	{
		int first = 0;		// index: 0 to length-1
		int last = length - 1;
		int middle = 0;
		boolean found = false;
		int position = -1;
		while (last >=first && !found)
		{
			middle = (first + last) / 2;
			if ( item < data[middle] )	// located first half
				last = middle - 1;
				else if ( item > data[middle] )// located last half
				first = middle + 1;
			else	found = true;
		}  // found or not find (last < first)
		if(found)
			position = middle;
		return position;
	}
	public static void main(String[] args)
	{
	    Scanner input=new Scanner(System.in);
	    int item;
		int[] b = {2, 5, 7, 11, 14, 16, 18, 30};
		SortedList myList = new SortedList();
		for(int i=0; i<b.length; i++)
			myList.Insert(b[i]);
		System.out.println("Total = " + myList.Length());
		System.out.println("The list is: ");
		myList.Print ();
		// Search an item
		System.out.println("Type the item to be found: ");
		item = input.nextInt();
		if (myList.IsPresent (item))
			System.out.println("Found.\n");
		else
			System.out.println("Not find.\n");
	}
}