Generate all the binary strings of N bits
Given a positive integer number N. The task is to generate all the binary strings of N bits. These binary strings should be in ascending order.
Examples:
Input: 2 Output: 0 0 0 1 1 0 1 1 Input: 3 Output: 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1
Approach: The idea is to try every permutation. For every position, there are 2 options, either ‘0’ or ‘1’. Backtracking is used in this approach to try every possibility/permutation.
Below is the implementation of the above approach:
C++
// C++ implementation of the above approach: #include <bits/stdc++.h>using namespace std; // Function to print the outputvoid printTheArray(int arr[], int n){ for (int i = 0; i < n; i++) { cout << arr[i] << " "; } cout << endl;} // Function to generate all binary stringsvoid generateAllBinaryStrings(int n, int arr[], int i){ if (i == n) { printTheArray(arr, n); return; } // First assign "0" at ith position // and try for all other permutations // for remaining positions arr[i] = 0; generateAllBinaryStrings(n, arr, i + 1); // And then assign "1" at ith position // and try for all other permutations // for remaining positions arr[i] = 1; generateAllBinaryStrings(n, arr, i + 1);} // Driver Codeint main(){ int n = 4; int arr[n]; // Print all binary strings generateAllBinaryStrings(n, arr, 0); return 0;} |
Java
// Java implementation of the above approach:import java.util.*; class GFG{ // Function to print the outputstatic void printTheArray(int arr[], int n){ for (int i = 0; i < n; i++) { System.out.print(arr[i]+" "); } System.out.println();} // Function to generate all binary stringsstatic void generateAllBinaryStrings(int n, int arr[], int i){ if (i == n) { printTheArray(arr, n); return; } // First assign "0" at ith position // and try for all other permutations // for remaining positions arr[i] = 0; generateAllBinaryStrings(n, arr, i + 1); // And then assign "1" at ith position // and try for all other permutations // for remaining positions arr[i] = 1; generateAllBinaryStrings(n, arr, i + 1);} // Driver Codepublic static void main(String args[]){ int n = 4; int[] arr = new int[n]; // Print all binary strings generateAllBinaryStrings(n, arr, 0);}} // This code is contributed by// Surendra_Gangwar |
Python3
# Python3 implementation of the # above approach # Function to print the output def printTheArray(arr, n): for i in range(0, n): print(arr[i], end = " ") print() # Function to generate all binary strings def generateAllBinaryStrings(n, arr, i): if i == n: printTheArray(arr, n) return # First assign "0" at ith position # and try for all other permutations # for remaining positions arr[i] = 0 generateAllBinaryStrings(n, arr, i + 1) # And then assign "1" at ith position # and try for all other permutations # for remaining positions arr[i] = 1 generateAllBinaryStrings(n, arr, i + 1) # Driver Code if __name__ == "__main__": n = 4 arr = [None] * n # Print all binary strings generateAllBinaryStrings(n, arr, 0) # This code is contributed # by Rituraj Jain |
C#
// C# implementation of the above approach:using System; class GFG{ // Function to print the outputstatic void printTheArray(int []arr, int n){ for (int i = 0; i < n; i++) { Console.Write(arr[i]+" "); } Console.WriteLine();} // Function to generate all binary stringsstatic void generateAllBinaryStrings(int n, int []arr, int i){ if (i == n) { printTheArray(arr, n); return; } // First assign "0" at ith position // and try for all other permutations // for remaining positions arr[i] = 0; generateAllBinaryStrings(n, arr, i + 1); // And then assign "1" at ith position // and try for all other permutations // for remaining positions arr[i] = 1; generateAllBinaryStrings(n, arr, i + 1);} // Driver Codepublic static void Main(String []args){ int n = 4; int[] arr = new int[n]; // Print all binary strings generateAllBinaryStrings(n, arr, 0);}} // This code has been contributed by 29AjayKumar |
PHP
<?php// PHP implementation of the above approach // Function to print the outputfunction printTheArray($arr, $n){ for ($i = 0; $i < $n; $i++) { echo $arr[$i], " "; } echo "\n";} // Function to generate all binary stringsfunction generateAllBinaryStrings($n, $arr, $i){ if ($i == $n) { printTheArray($arr, $n); return; } // First assign "0" at ith position // and try for all other permutations // for remaining positions $arr[$i] = 0; generateAllBinaryStrings($n, $arr, $i + 1); // And then assign "1" at ith position // and try for all other permutations // for remaining positions $arr[$i] = 1; generateAllBinaryStrings($n, $arr, $i + 1);} // Driver Code$n = 4; $arr = array_fill(0, $n, 0); // Print all binary stringsgenerateAllBinaryStrings($n, $arr, 0); // This code is contributed by Ryuga ?> |
Output:
0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1
Related Article: Generate all the binary number from 0 to n
Want to learn from the best curated videos and practice problems, check out the C++ Foundation Course for Basic to Advanced C++ and C++ STL Course for foundation plus STL. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
