Creating all binary strings with n 1's and n 0's

Question

if i wanted to create all possible strings of n 1's and n 0's where there are never more 0's than 1's using 2 for loops and recursion how would i go about this? (the first for loop controlls how many 1's are in the string the second how many 0's up to the number of 1's) What would the recursive alogrithim have to look like inorder for me to create every possible string of n 1's and n 0's where there are never more 0's than 1's ?

Answer 1

{color:#ff0000}Cross posted{color}
{color:#000080}Including this post --{color}{color:#0000ff}
http://forum.java.sun.com/thread.jspa?threadID=5223773
http://forum.java.sun.com/thread.jspa?threadID=5223679
http://forum.java.sun.com/thread.jspa?threadID=5223774{color}{color:000080}
Cross posting is rude.
{color}