A type of balanced 0–1 matrix

Question

0.00/5 (No votes)

See more:

Hi...I wanna write a program in java that can count the number of balanced matrix of N*N...the only way that I know is to consider all the possible assginments for the matrix and then choose the answers...I searched the topic and found something about it in wikipedia...it solved the problem with dynamic programming but unfortunately I don't understand exactly the algorithm...can anyone help and explain completely with example for me what to do ?
this is the link that I found :
http://en.wikipedia.org/wiki/Dynamic_programming#A_type_of_balanced_0.E2.80.931_matrix[^]

Posted 21-Jan-12 4:45am

Member 8586072

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

TorstenH. · Answer 1 · 2012-01-22T20:53:00

Solution 1

It's using recursive methods.

2 articles / tutorials to this:
http://www.hostitwise.com/java/java_recursion.html[^]

http://www.javaworld.com/javaworld/javatips/jw-javatip62.html[^]

Posted 22-Jan-12 20:53pm

TorstenH.

Comments

[no name] 23-Jan-12 8:39am

Dear friend...I know what recursive methods are...but I don't understand the use of them here in this algorithm ! I don't understand the explanation of solving this problem in Wikipedia...
Anyway...Thanks !