Time Complexity for a specific nested for loop

Question

I am looking for the time complexity (big O) for the following nested loop. Given an array A[] with size n.

for (i=1; i<=n/2; i++){
    for(j=i; j<=n-i; j++){
        print (A[j]);
    }
}

In this problem A is indexed at 1. so the first element of A[] is A[1].

Chad S. · Accepted Answer · 2015-10-15 20:18:35Z

2

Since the innermost execution time is constant, we have

So T(n) is O(n^2)

answered Oct 15, 2015 at 20:18

Chad S.

6,66918 silver badges26 bronze badges

Sign up to request clarification or add additional context in comments.

1 Answer 1