public static void findMaxSubArrayBrute(int[] A)
	{
		int maxSum=Integer.MIN_VALUE;
		int sum=0;
		int start=0;
		int end=0;
		
		for ( int i=0;i<A.length;i++)
		{
			if(maxSum<A[i])
				maxSum=A[i];
			
			sum=A[i];
			for (int j=i+1;j<A.length;j++)
			{
				sum=sum+A[j];
				if(sum>maxSum)
				{
					maxSum=sum;
					start=i;
					end=j;
				}
			}
		}
		
		System.out.println("start"+start+" end"+end+" MaxSum:"+maxSum);
	}