2010-09-28, 01:16 PM
So, I'm going to apologize for asking for homework help again. Seems i do this far too often. I have a CS1 assignment on recursion and I am having a bit of a hard time. The purpose of the assignment is to take in data on how much certain couples liked each other during a speed dating session and come up with the best match overall. I put the data in a 2d array, with how well each couple gets along in it. The problem now is i am supposed to use recursion to come up with all the permutations, and add the number corresponding to how well each couple has match. There will always be same number of men as women, so thats easy enough. I think i'm just drawing a blank on the whole function. I looked at some other similar recursions(sample programs and the like) but all of them just did it with strings/1d arrays and I just cant really wrap my head around getting it to work for a 2d array.

