if new element is less than previous minimum element then update it so that we may get maximum difference in remaining array
if ( rowSum [ i ] < min_element ) min_element = rowSum [ i ] ; } return max_diff ; }