I have a matrix and 2 pointers i,j.
Sub-matrix is a square or rectangle, which begins in one of the cells in the matrix and continues until the cell [n-1] [m-1].
The function has to calculate the starting cells that sum of the values of its sub-matrix is the highest, and save the the this sub-matrix indexes with the pointers i,j.
Can anyone help me with this?
Read the homework policy (Announcements - General Programming Boards), you will need to make some effort on your own before we get to helping you with code.
As has been pointed out to you in one of your other threads, working this out on paper first is a good idea. You can start with a 5x5 matrix with random numbers; check sub-matrices of, say, 2x2 size. Do it by hand and pay close attention to how you move through the matrix and the sub-matrices, and how the sub-matrix moves. Also, pay close attention to how you handle this near the edges.
Note, you call i and j "pointers". You could do this with pointers, but it seems declaring i and j as ints and using them as array indices would be easier.
You likely wont get any more help until you make a real effort and show us your code. Remember, it needs to be posted in [code][/code] tags, and it should be properly formatted and indented: Indent style - Wikipedia, the free encyclopedia.
