Question

void subelement ( int n, const array S[])

{

if(n<3)

{

print("Not enough elements for subset")

}

index i, j, k;

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

{

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

{

for (k = j +1; k<=n;k++)

{

print(S[i],S[j],S[k])

}

}

}

}

Is the time complexity O(n^3)??

is there an worst case complexity?

Answer 1

void subelement(int n, const array S[]) {
    if (n < 3) {
        print("Not enough elements for subset")
    }
    index i, j, k;
    for (i = 1; i <= n; i++) {  // iterates n times
        for (j = i + 1; j <= n; j++) {  // iterates j=O(n) times
            for (k = j + 1; k <= n; k++) {  // iterates k=O(n) times
                print(S[i], S[j], S[k])
            }
        }
    }
}

total number of iterations = n*n*n = n^3
so, time complexity is O(n^3)

Yes, It has worst case time complexity. and it is O(n^3)