Search:

OH. Silly me for initializing total to zero every time...
Like how i'm talking to myself too?

I've got some conditions that i forgot to mention: the largest size is a 2d array of size 10 and there are the same amount of columns as there are rows.
I'm not sure how, but I've gotten it to...

I changed my swap to

int swap(int mmin[10][10], int j, int k, int realsize){ int i, temp;
for(i=0;i<=realsize;i++){
printf("swapping [%d][%d]=%d with [%d][%d]=%d\n", i, j, mmin[i][j], i,...

I need to get find the maximum possible sum of a 2D array, but can only use one number per row/column (similar to the Hungarian Method). I've been working on the code for quite some time, but I...