Showing your code will help understand where you are stuck and what it is you are doing; Is it a minor problem with the way you make your recursive calls or something else?

But here is something that might help:

If you look at the strings you are trying to generate you will notice that a recursive function will generate the same substring multiple times.

For example, the string '01' is generated twice once for each of '001' and '101'. This is clearly not necessary.

When you write out your recursive program you need to ensure that your code does not have to do this. One way to do that is to maintain an array ( potentially multidimensional ) which holds previously calculated values.

Give this a shot - Let us know what you get.


In reply to Re: all binary combinations by tmharish
in thread all binary combinations by perlrocks

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.