Question

10 pts Question 2 Let A[1.n] and B[1.m] be two arrays, where n 2 mz 1. Use pseudocode to write an algorithm which prints TRUE if the array A contains the sequence B, and FALSE otherwise. The elements from B must appear in order, but they do not have to occur as a contiguous sequence in A. The running time of the algorithm must be O(n). some examples: Here are <5,6,8> then the algorithm prints TRUE - if A = <10, 3, 21, 5, 6, 14, 17,9, 5,6,8, 11, 12> and B - if A = < 10, 3, 21, 5, 6, 14, 17,9,5, 6,8, 11, 12> and B- <3, 14, 11, 12>, then the algorithm prints TRUE - if A= <10,3, 21, 5, 6, 14, 17,9, 5, 6,8, 11, 12> and B <6,5, 14>, then the algorithm prints FALSE Upload Choose a File

Answer 1

Solution:

1. Ask the user to enter elements into the first array
2. Ask the user to enter elements into the second array
3. Calculate the size of the first array
4. Calculate the size of the second array
5. Check whether the second array is greater than the first array, if Yes then return false.
6. Take a counter j and initialize it to zero

7. Run a loop till statement 11: for (int i = 0; (i < array1_size) && (j != array2_size) ; i++)

8. Check if (array1[i] == array2[j]) then increment the value of j else Initialize the value of j to 0. // if elements of first array matches with the second

9. Check if (i > array1_size - array2_size) then break

10. Check if (j == array2_size) the return true else return false.

Answer 2

Algorithm for the given condition can be stated as:

Function checkArray(Parameter 1 as First array,Parameter 2 as second array,Parameter 3 as size of first array (let n),Parameter 4 as size of second array (let m))

Two pointers to traverse the arrays(i and j)

Traverse both arrays simultaneously

WHILE  i < n AND j < m

IF element matches increment both pointers(i++ && j++)

IF array B is completely traversed( j == m)

RETURN TRUE

ENDIF

ENDIF

ELSE

increment i and reset j(i++ && j= 0 )

ENDELSE

ENDWHILE

RETURN FALSE

ENDFunction

This algorithm Time complexity is O(n)

Here is a implementation of above algorithm in a proper function for further references:-

bool checkArray(int A[], int B[], int n, int m)

{

    // Two pointers to traverse the arrays

    int i = 0, j = 0;

  

    // Traverse both arrays simultaneously

    while (i < n && j < m) {

  

        // If element matches

        // increment both pointers

        if (A[i] == B[j]) {

  

            i++;

            j++;

  

            // If array B is completely

            // traversed

            if (j == m)

                return true;

        }

        // If not,

        // increment i and reset j

        else {

            i++;

            j = 0;

        }

    }

  

    return false;

}