Tycoon Talk
Become a Big fish!
The number 1 forum for online business!
Post topics, ask questions, share your knowledge.
Tycoon Talk is part of Freelancer.com - find skilled workers online at a fraction of the cost.

Coding Forum


You are currently viewing our Coding Forum as a guest. Please register to participate.
Login



Reply
using recursion to generate all possible bitstring of length n
Old 02-01-2009, 03:01 AM using recursion to generate all possible bitstring of length n
Junior Talker

Posts: 1
Trades: 0
I'm trying to make a 2d array filled with the truth table for n amount of variables

ex. 3 variables will create an array that looks like this

0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

i'm having trouble coming up with a recursive algorithm to generate all possible bitstrings.
any help would be appreaciated. thanks

Last edited by IRnick; 02-01-2009 at 03:09 AM..
IRnick is offline
Reply With Quote
View Public Profile
 
 
Register now for full access!
Reply     « Reply to using recursion to generate all possible bitstring of length n
 

Thread Tools Search this Thread
Search this Thread:

Advanced Search

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are Off
Pingbacks are Off
Refbacks are Off





   
RSS Feed  Feeds: RSS   JS   XML
RSS Feed  Feeds for this forum: RSS   JS   XML



Page generated in 0.12774 seconds with 12 queries