Geeks To Go is a helpful hub, where thousands of volunteer geeks quickly serve friendly answers and support. Check out the forums and get free advice from the experts. Register now to gain access to all of our features, it's FREE and only takes one minute. Once registered and logged in, you will be able to create topics, post replies to existing threads, give reputation to your fellow members, get your own private messenger, post status updates, manage your profile and so much more.

Create Account How it Works

# code: all possible arrangements of MD array

### #1 Rob M Posted 21 June 2005 - 11:05 AM

Rob M

New Member

• Member
• 2 posts
Can someone provide me with C++ code to do the following:

Find all 4! = 24 arrangements of the following 4 x 2 MD array:

-1 -1
1 -1
-1 1
1 1

Similarly, find all 8! = 40,320 arrangements of the following 8 x 3 MD array:

-1 -1 -1
1 -1 -1
-1 1 -1
1 1 -1
-1 -1 1
1 -1 1
-1 1 1
1 1 1

Thank you very much
• 0

### #2 kool808 Posted 21 June 2005 - 04:06 PM

kool808

Visiting Staff

• Member
• 1,690 posts
it will get a better reply at this forum

http://www.geekstogo...ET_etc-f60.html
• 0

### Similar Topics

#### 0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users