Given two sorted arrays A and B, generate all possible arrays such that first element is taken from A then from B then from A and so on in increasing order till the arrays exhausted. The generated arrays should end with an element from B.
For Example
A = {10, 15, 25}
B = {1, 5, 20, 30}
The resulting arrays are:
10 20
10 20 25 30
10 30
15 20
15 20 25 30
15 30
25 30
We strongly recommend you to minimize your browser and try this yourself first.
The idea is to use recursion. In the recursive function, a flag is passed to indicate whether current element in output should be taken from ‘A’ or ‘B’. Below is C++ implementation.
C++
#include<bits/stdc++.h> using namespace std; void printArr(int arr[], int n); /* Function to generates and prints all sorted arrays from alternate elements of 'A[i..m-1]' and 'B[j..n-1]' If 'flag' is true, then current element is to be included from A otherwise from B. 'len' is the index in output array C[]. We print output array each time before including a character from A only if length of output array is greater than 0. We try than all possible combinations */void generateUtil(int A[], int B[], int C[], int i, int j, int m, int n, int len, bool flag) { if (flag) // Include valid element from A { // Print output if there is at least one 'B' in output array 'C' if (len) printArr(C, len+1); // Recur for all elements of A after current index for (int k = i; k < m; k++) { if (!len) { /* this block works for the very first call to include the first element in the output array */ C[len] = A[k]; // don't increment lem as B is included yet generateUtil(A, B, C, k+1, j, m, n, len, !flag); } else /* include valid element from A and recur */ { if (A[k] > C[len]) { C[len+1] = A[k]; generateUtil(A, B, C, k+1, j, m, n, len+1, !flag); } } } } else /* Include valid element from B and recur */ { for (int l = j; l < n; l++) { if (B[l] > C[len]) { C[len+1] = B[l]; generateUtil(A, B, C, i, l+1, m, n, len+1, !flag); } } } } /* Wrapper function */void generate(int A[], int B[], int m, int n) { int C[m+n]; /* output array */ generateUtil(A, B, C, 0, 0, m, n, 0, true); } // A utility function to print an array void printArr(int arr[], int n) { for (int i = 0; i < n; i++) cout << arr[i] << " "; cout << endl; } // Driver program int main() { int A[] = {10, 15, 25}; int B[] = {5, 20, 30}; int n = sizeof(A)/sizeof(A[0]); int m = sizeof(B)/sizeof(B[0]); generate(A, B, n, m); return 0; } |
chevron_right
filter_none
Java
class GenerateArrays { /* Function to generates and prints all sorted arrays from alternate elements of 'A[i..m-1]' and 'B[j..n-1]' If 'flag' is true, then current element is to be included from A otherwise from B. 'len' is the index in output array C[]. We print output array each time before including a character from A only if length of output array is greater than 0. We try than all possible combinations */ void generateUtil(int A[], int B[], int C[], int i, int j, int m, int n, int len, boolean flag) { if (flag) // Include valid element from A { // Print output if there is at least one 'B' in output array 'C' if (len != 0) printArr(C, len + 1); // Recur for all elements of A after current index for (int k = i; k < m; k++) { if (len == 0) { /* this block works for the very first call to include the first element in the output array */ C[len] = A[k]; // don't increment lem as B is included yet generateUtil(A, B, C, k + 1, j, m, n, len, !flag); } /* include valid element from A and recur */ else if (A[k] > C[len]) { C[len + 1] = A[k]; generateUtil(A, B, C, k + 1, j, m, n, len + 1, !flag); } } } /* Include valid element from B and recur */ else { for (int l = j; l < n; l++) { if (B[l] > C[len]) { C[len + 1] = B[l]; generateUtil(A, B, C, i, l + 1, m, n, len + 1, !flag); } } } } /* Wrapper function */ void generate(int A[], int B[], int m, int n) { int C[] = new int[m + n]; /* output array */ generateUtil(A, B, C, 0, 0, m, n, 0, true); } // A utility function to print an array void printArr(int arr[], int n) { for (int i = 0; i < n; i++) System.out.print(arr[i] + " "); System.out.println(""); } public static void main(String[] args) { GenerateArrays generate = new GenerateArrays(); int A[] = {10, 15, 25}; int B[] = {5, 20, 30}; int n = A.length; int m = B.length; generate.generate(A, B, n, m); } } // This code has been contributed by Mayank Jaiswal |
chevron_right
filter_none
Python3
# A utility function to print an array def printArr(arr,n): for i in range(n): print(arr[i] , " ",end="") print() ''' Function to generates and prints all sorted arrays from alternate elements of 'A[i..m-1]' and 'B[j..n-1]' If 'flag' is true, then current element is to be included from A otherwise from B. 'len' is the index in output array C[]. We print output array each time before including a character from A only if length of output array is greater than 0. We try than all possible combinations '''def generateUtil(A,B,C,i,j,m,n,len,flag): if (flag): # Include valid element from A # Print output if there is at # least one 'B' in output array 'C' if (len): printArr(C, len+1) # Recur for all elements of # A after current index for k in range(i,m): if ( not len): ''' this block works for the very first call to include the first element in the output array ''' C[len] = A[k] # don't increment lem # as B is included yet generateUtil(A, B, C, k+1, j, m, n, len, not flag) else: # include valid element from A and recur if (A[k] > C[len]): C[len+1] = A[k] generateUtil(A, B, C, k+1, j, m, n, len+1, not flag) else: # Include valid element from B and recur for l in range(j,n): if (B[l] > C[len]): C[len+1] = B[l] generateUtil(A, B, C, i, l+1, m, n, len+1, not flag) # Wrapper function def generate(A,B,m,n): C=[] #output array for i in range(m+n+1): C.append(0) generateUtil(A, B, C, 0, 0, m, n, 0, True) # Driver program A = [10, 15, 25] B = [5, 20, 30] n = len(A) m = len(B) generate(A, B, n, m) # This code is contributed # by Anant Agarwal. |
chevron_right
filter_none
C#
// C# Program to generate all possible // sorted arrays from alternate elements // of two given sorted arrays using System; class GenerateArrays { /* Function to generates and prints all sorted arrays from alternate elements of 'A[i..m-1]' and 'B[j..n-1]' If 'flag' is true, then current element is to be included from A otherwise from B. 'len' is the index in output array C[]. We print output array each time before including a character from A only if length of output array is greater than 0. We try than all possible combinations */ public virtual void generateUtil(int[] A, int[] B, int[] C, int i, int j, int m, int n, int len, bool flag) { // Include valid // element from A if (flag) { // Print output if there is // at least one 'B' in // output array 'C' if (len != 0) { printArr(C, len + 1); } // Recur for all elements // of A after current index for (int k = i; k < m; k++) { if (len == 0) { /* this block works for the very first call to include the first element in the output array */ C[len] = A[k]; // don't increment lem // as B is included yet generateUtil(A, B, C, k + 1, j, m, n, len, !flag); } // include valid element // from A and recur else if (A[k] > C[len]) { C[len + 1] = A[k]; generateUtil(A, B, C, k + 1, j, m, n, len + 1, !flag); } } } // Include valid element // from B and recur else { for (int l = j; l < n; l++) { if (B[l] > C[len]) { C[len + 1] = B[l]; generateUtil(A, B, C, i, l + 1, m, n, len + 1, !flag); } } } } // Wrapper function public virtual void generate(int[] A, int[] B, int m, int n) { int[] C = new int[m + n]; // output array generateUtil(A, B, C, 0, 0, m, n, 0, true); } // A utility function to print an array public virtual void printArr(int[] arr, int n) { for (int i = 0; i < n; i++) { Console.Write(arr[i] + " "); } Console.WriteLine(""); } // Driver Code public static void Main(string[] args) { GenerateArrays generate = new GenerateArrays(); int[] A = new int[] {10, 15, 25}; int[] B = new int[] {5, 20, 30}; int n = A.Length; int m = B.Length; generate.generate(A, B, n, m); } } // This code is contributed by Shrikant13 |
chevron_right
filter_none
PHP
<?php /* Function to generates and prints all sorted arrays from alternate elements of 'A[i..m-1]' and 'B[j..n-1]' If 'flag' is true, then current element is to be included from A otherwise from B. 'len' is the index in output array C[]. We print output array each time before including a character from A only if length of output array is greater than 0. We try than all possible combinations */function generateUtil(&$A, &$B, &$C, $i, $j, $m, $n, $len, $flag) { if ($flag) // Include valid element from A { // Print output if there is at least // one 'B' in output array 'C' if ($len) printArr($C, $len + 1); // Recur for all elements of A // after current index for ($k = $i; $k < $m; $k++) { if (!$len) { /* this block works for the very first call to include the first element in the output array */ $C[$len] = $A[$k]; // don't increment lem as B // is included yet generateUtil($A, $B, $C, $k + 1, $j, $m, $n, $len, !$flag); } else /* include valid element from A and recur */ { if ($A[$k] > $C[$len]) { $C[$len + 1] = $A[$k]; generateUtil($A, $B, $C, $k + 1, $j, $m, $n, $len + 1, !$flag); } } } } else /* Include valid element from B and recur */ { for ($l = $j; $l < $n; $l++) { if ($B[$l] > $C[$len]) { $C[$len + 1] = $B[$l]; generateUtil($A, $B, $C, $i, $l + 1, $m, $n, $len + 1, !$flag); } } } } /* Wrapper function */function generate(&$A, &$B, $m, $n) { $C = array_fill(0, ($m + $n), NULL); /* output array */ generateUtil($A, $B, $C, 0, 0, $m, $n, 0, true); } // A utility function to print an array function printArr(&$arr, $n) { for ($i = 0; $i < $n; $i++) echo $arr[$i] . " "; echo "\n"; } // Driver Code $A = array(10, 15, 25); $B = array(5, 20, 30); $n = sizeof($A); $m = sizeof($B); generate($A, $B, $n, $m); // This code is contributed by ChitraNayal ?> |
chevron_right
filter_none
Output:
10 20 10 20 25 30 10 30 15 20 15 20 25 30 15 30 25 30
This article is contributed by Gaurav Ahirwar. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above\
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Find product of all elements at indexes which are factors of M for all possible sorted subsequences of length M
- Generate an alternate increasing and decreasing Array
- Minimum LCM and GCD possible among all possible sub-arrays
- XOR of all possible pairwise sum from two given Arrays
- Minimum possible Bitwise OR of all Bitwise AND of pairs generated from two given arrays
- Generate all possible strings such that char at index i is either str1[i] or str2[i]
- Generate all possible permutations of a Number divisible by N
- Minimum elements to change so that for an index i all elements on the left are -ve and all elements on the right are +ve
- Alternate XOR operations on sorted array
- Generate original array from difference between every two consecutive elements
- Generate an array of K elements such that sum of elements is N and the condition a[i] < a[i+1] <= 2*a[i] is met | Set 2
- Print uncommon elements from two sorted arrays
- Generate two BSTs from the given array such that maximum height among them is minimum
- Generate elements of the array following given conditions
- Count pairs from two sorted arrays whose sum is equal to a given value x
- Print all possible combinations of r elements in a given array of size n
- Find if it is possible to make all elements of an array equal by the given operations
- Maximize Sum possible by subtracting same value from all elements of a Subarray of the given Array
- Generate all passwords from given character set
- Minimum number of coins that can generate all the values in the given range
