public class g_george_hw_1 {

		public static void main(String[] args) 
		{
			Integer[] input = { 100, 37, 49 };
			boolean result1 = contains (input, new Prime() );
			boolean result2 = contains (input, new PerfectSquare() );
			boolean result3 = contains (input, new Negative() );
			
			System.out.println("Result 1: " + result1);
			System.out.println("Result 2: " + result2);
			System.out.println("Result 3: " + result3);
		}

		public static <AnyType> boolean contains ( AnyType [] Arr, FinderInterface<Number> Obj)
		{
			return Obj.finder((Number[]) Arr);
		}
		
		public interface FinderInterface <AnyType extends Number> {
			
			public boolean finder (AnyType[] arr);
			
		}
		
		public static class Prime implements FinderInterface
		{
			@Override
			public boolean finder(Number[] noArray) {
				boolean found = false;
				for ( Object i: noArray ) {
					int no = (Integer) i;
					if ( found ) 
						return true;
					found = true;
					for ( int j=2; j<no; j++ ) {
						if ( no%j == 0 )
							found = false;
					}
				}
				if ( found ) 
					return true;
				else 
					return false;
			}
		}

		public static class Negative implements FinderInterface{

			public boolean finder(Number[] noArray) {
				for ( Number i: noArray ) {
					int no = (Integer) i;
					if ( no < 0 )
						return true;
				}
				return false;
			}
		}
		
		public static class PerfectSquare implements FinderInterface{

			@Override
			public boolean finder(Number[] noArray) {
				for ( Object i: noArray ) {
					int no = (Integer) i;
					int sqRoot = (int) Math.sqrt(no);
					if ( (sqRoot * sqRoot) == no )
						return true;
				}
				return false;
			}

		}
		
	}