|
-
August 7th, 2011, 06:06 AM
#6
Re: List combination algorithm
Oh sorry, i did not read carefully.
So my proof would be:
1. as long as you move in the diagonal both (i) and (j) are changing.
2. If you step from one diagonal to another sometimes i or j will stay the same
So follow the diagonals as long as possible, then switch.
GMarco
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|