Subarray Substring vs Subsequence

来源：互联网发布：软件打不开的原因编辑：程序博客网时间：2024/06/01 10:48

Subarray/Substring vs Subsequence and Programs to Generate them

Subarray/Substring
A subbarray is a contiguous part of array. An array that is inside another array. For example, consider the array [1, 2, 3, 4], There are 10 non-empty sub-arrays. The subbarays are (1), (2), (3), (4), (1,2), (2,3), (3,4), (1,2,3), (2,3,4) and (1,2,3,4). In general, for an array/string of size n, there are n*(n+1)/2 non-empty subarrays/subsrings.

How to generate all subarrays?
We can run two nested loops, the outer loop picks starting element and inner loop considers all elements on right of the picked elements as ending element of subarray.

/*  C++ code to generate all possible subarrays/subArrays
    Complexity- O(n^3) */
#include<bits/stdc++.h>
usingnamespacestd;
 
// Prints all subarrays in arr[0..n-1]
voidsubArray(intarr[],intn)
{
    // Pick starting point
    for(inti=0; i <n; i++)
    {
        // Pick ending point
        for(intj=i; j<n; j++)
        {
            // Print subarray between current starting
            // and ending points
            for(intk=i; k<=j; k++)
                cout << arr[k] <<" ";
 
            cout << endl;
        }
    }
}
 
// Driver program
intmain()
{
    intarr[] = {1, 2, 3, 4};
    intn =sizeof(arr)/sizeof(arr[0]);
    cout <<"All Non-empty Subarrays\n";
    subArray(arr, n);
    return0;
}

Output:

All Non-empty Subarrays1 1 2 1 2 3 1 2 3 4 2 2 3 2 3 4 3 3 4 4

Subsequence
A subsequence is a sequence that can be derived from another sequence by zero or more elements, without changing the order of the remaining elements.
For the same example, there are 15 sub-sequences. They are (1), (2), (3), (4), (1,2), (1,3),(1,4), (2,3), (2,4), (3,4), (1,2,3), (1,2,4), (1,3,4), (2,3,4), (1,2,3,4). More generally, we can say that for a sequence of size n, we can have (2n-1) non-empty sub-sequences in total.

A string example to differentiate: Consider strings “geeksforgeeks” and “gks”. “gks” is a subsequence of “geeksforgeeks” but not a substring. “geeks” is both a subsequence and subarray. Every subarray is a subsequence. More specifically, Subsequence is a generalization of substring.

How to generate all Subsequences?
We can use algorithm to generate power set for generation of all subsequences.

/*  C++ code to generate all possible subsequences.
    Time Complexity O(n * 2^n) */
#include<bits/stdc++.h>
usingnamespacestd;
 
voidprintSubsequences(intarr[],intn)
{
    /* Number of subsequences is (2**n -1)*/
    unsignedintopsize = pow(2, n);
 
    /* Run from counter 000..1 to 111..1*/
    for(intcounter = 1; counter < opsize; counter++)
    {
        for(intj = 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
intmain()
{
    intarr[] = {1, 2, 3, 4};
    intn =sizeof(arr)/sizeof(arr[0]);
    cout <<"All Non-empty Subsequences\n";
    printSubsequences(arr, n);
    return0;
}

All Non-empty Subsequences1 2 1 2 3 1 3 2 3 1 2 3 4 1 4 2 4 1 2 4 3 4 1 3 4 2 3 4 1 2 3 4

This article is contributed by Harshit Gupta. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

0 0