Breaking News: Grepper is joining You.com. Read the official announcement!

subsequence

Ramanand Thakur answered on March 12, 2022 Popularity 10/10 Helpfulness 1/10

answer subsequence

related subsequence

subsequence

Comment

/*  C++ code to generate all possible subsequences.
    Time Complexity O(n * 2^n) */
#include<bits/stdc++.h>
using namespace std;
 
void printSubsequences(int arr[], int n)
{
    /* Number of subsequences is (2**n -1)*/
    unsigned int opsize = pow(2, n);
 
    /* Run from counter 000..1 to 111..1*/
    for (int counter = 1; counter < opsize; counter++)
    {
        for (int j = 0; j < n; j++)
        {
            /* Check if jth bit in the counter is set
                If set then print jth element from arr[] */
            if (counter & (1<<j))
                cout << arr[j] << " ";
        }
        cout << endl;
    }
}
 
// Driver program
int main()
{
    int arr[] = {1, 2, 3, 4};
    int n = sizeof(arr)/sizeof(arr[0]);
    cout << "All Non-empty Subsequences\n";
    printSubsequences(arr, n);
    return 0;
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ subsequence

Link to this answer
Share Copy Link

Contributed on Mar 12 2022

Ramanand Thakur

0 Answers Avg Quality 2/10

Closely Related Answers

subsequence

Comment

def sub(s, out, i):
    if i >= len(s):
        print(out)
        return
    sub(s, out + [s[i]], i + 1)  # Concatenate out with [s[i]]
    sub(s, out, i + 1)

sub([1, 2, 3], [], 0)

Popularity 9/10 Helpfulness 1/10 Language python

Source: chat.openai.com

Tags: python py

Link to this answer
Share Copy Link

Contributed on Jun 28 2023

ADESH KUMAR

0 Answers Avg Quality 2/10

subsequence

Contents

More Related Answers

subsequence

Closely Related Answers

subsequence

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.