Generate All Strings of n bits.

Objec­tive: Generate All Strings of n bits, consider A[0..n-1] is an array of size n.

Example :

n = 3
Output:
[0, 0, 0]    [1, 0, 0]    [0, 1, 0]    [1, 1, 0]

[0, 0, 1]     [1, 0, 1]     [0, 1, 1]    [1, 1, 1]

Approach:

  • Recursion is key here.
  • create a integer array of size n.
  • Now if we think of every bit, it can take 2 values, 0 and 1.
  • starting from the end of the string, set the bit 0 and 1 and make recursive calls

Time Complexity – O(2^n)
Code:


Output:

[0, 0, 0]
[1, 0, 0]
[0, 1, 0]
[1, 1, 0]
[0, 0, 1]
[1, 0, 1]
[0, 1, 1]
[1, 1, 1]

1 Response

  1. SUTHARI SANDEEP says:

    Hi,

    I’m told that backtracking is used here.Can someone please explain me how backtracking is done here??

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: