I was talking about this approach.
for( left_top_i=0 ; left_top_i<row_no ; left_top_i++ )
for( left_top_j=0 ; left_top_j<col_size ; left_top_j++ )
for( bottom_right_i=left_top_i ; bottom_right_i<row_size ;
bottom_right_i++ )
for( bottom_right_j=left_top_j ; bottom_right_j<row_size ;
bottom_right_j++ )
{
check area of matrix from ( left_top_i , left_top_j ) to
( bottom_right_i , bottom_right_j )
}
This is of O(n^4) complexity i think.
Please provide better solution.
Or direct to some algorithm to follow for this kind of problem.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
