c++ programming

Question

(i) Consider the following code:

int myFunc(int A[], int n) 

{ 

    int i, j, max = 0; 

    int msis[n]; 

  

    for ( i = 0; i < n; i++ ) 

        msis[i] = A[i]; 

  

    for ( i = 1; i < n; i++ ) 

        for ( j = 0; j < i; j++ ) 

            if (A[i] > A[j] && 

                msis[i] < msis[j] + A[i]) 

                msis[i] = msis[j] + A[i]; 

  

    for ( i = 0; i < n; i++ ) 

        if ( max < msis[i] ) 

            max = msis[i]; 

  

    return max; 

}

a)     What is the time complexity of the algorithm?

Answer 1

 for ( i = 1; i < n; i++ ) 

        for ( j = 0; j < i; j++ ) 

typical of ORDER N^2