public static int findMaxContinuousSubArrayDivideAndConquer(int[] A,int low, int high)
	{
		
		if(A==null || A.length==0)
		{
			System.out.println("Input is null or empty, invalid input!");
			
			return 0;
		}
		
		if(low==high)
		{
			return A[low];
		}
		
		int mid=low + (high - low)/2;
		
		int leftsum=findMaxContinuousSubArrayDivideAndConquer(A,low,mid);
		int rightsum=findMaxContinuousSubArrayDivideAndConquer(A,mid+1,high);
		int crossingsum=crossSubarray(A,low,high);
		
	    if (leftsum >= rightsum && leftsum >= crossingsum){
	        return leftsum;
	    }
	    if (rightsum >= leftsum && rightsum >= crossingsum){
	        return rightsum;
	    }
	    return crossingsum;
	}