public static boolean binarySearch(ArrayList<Integer> s, int x)
	{
		//For later
		ArrayList<Integer> sub = new ArrayList<Integer>();
		//corner cases
		if (s.size() == 0)
		{
			return false;
		}
		
		else
		{
			//If its equal to the middle then return true
			int middle = s.size()/2;
			if(s.get(middle) == x)
			{
				return true;
			}
			else
			{
				if(x<s.get(middle))
				{
					//up to not including middle
					for (int i =0; i<middle; i++)
					{
						sub.add(s.get(i));
					}
				}
				else
				{
					//everything after middle
					for (int i= middle+1; i<s.size(); i++)
					{
						sub.add(s.get(i));
					}
				}
				return binarySearch(sub, x);
			}
		}
		
	}