Divide and conquer challenge
I send you this challenge, create a program which gets a matrix of integers which can be positive and negative and returns the maximum sum of a rectangular submatrix in O(N^3) complexity using divide and conquer paradigm
what should be the size of submatrix?
ok, so size of submatrix can be variable.
it should be N×M
Yes,that is right