CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com

Search:

Type: Posts; User: IRnick

Search: Search took 0.03 seconds.

  1. Re: using recursion to generate all possible bitstrings of length n

    I thought you meant there was one in the API
  2. Re: using recursion to generate all possible bitstrings of length n

    I didn't think of iterative
  3. Re: using recursion to generate all possible bitstrings of length n

    wasn't homework. this is what we did



    private boolean allCombinations()
    {
    int firstZero=findZero();
    if (firstZero==2)
    return false; //all combinations...
  4. using recursion to generate all possible bitstrings of length n

    I'm trying to make a 2d array in java 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
  5. using recursion to generate all possible bitstrings of length n

    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
Results 1 to 5 of 5





Click Here to Expand Forum to Full Width

Featured