import javax.swing.*; 

public class StringBinarySearch
{
	public static void main(String [] args)
	{
		final int MAX_TRIES = 5;

		boolean done = false;
		boolean found = false;
		String input = "";
		int count = 0;

		String [] notOrdered = {"the","cake","is","a","lie"};
		String [] ordered = {"a","cake","is","lie","the"};

		print(ordered);

		boolean bool = inOrder(ordered);

		if(bool)
		{
			System.out.println("This array is ordered.");

			while(!done)
			{
				input = JOptionPane.showInputDialog("Enter the word you are looking for?",null);
				count++;
				System.out.println("Guess " +count +": " +input);

				found = findString(input, ordered);

				if(found || count == MAX_TRIES)
					done = true;
			}
		}
		else
			System.out.println("This array is not in order, I cannot search it.");


		if(found)
		{
			System.out.println("By Jove, the array contains " +input +"!");
			System.out.println("It took you " +count +" attempt(s) to get it.");
		}
		else
		{
			System.out.println("By Jove, it took you " +count +" tries and you still didn't get it?");
		}
	}
	public static boolean inOrder(String [] array)
	{
		boolean bool = true;

		for(int i = 0; i < array.length - 1; i++)
		{
			if(array[i].compareTo(array[i+1]) > 0)
				bool = false;
		}
		return bool;
	}

	private static boolean findString(String str, String [] array)
	{
		boolean found = false;
		int high;
		int low;
		int mid;

		if(array != null)
		{
		    high = array.length - 1;
		    low = 0;

		    while(!found && high >= low)
		    {
			mid = (high + low) / 2;

			if(array[mid].compareTo(str) < 0)
			    low = mid + 1;

			else if(array[mid].compareTo(str) > 0)
			    high = mid - 1;

			else
			    found = true;
		    }
		}

		return found;
	}
	public static void print(String [] array)
	{
		System.out.print("Array: ");

		for(int i = 0; i < array.length; i++)
			System.out.print("\"" +array[i] +"\" ");

		System.out.println();
	}

}