Big Big O (III)

1
2
3
4
5
6
7
8

for(int i=0; i<n; i++){
    for(int j=0; j<10; j++){
        if(A[i][j]%2){
            cout<<A[i][j];
        }
        cout<<endl;
    }
}

The c++ code given above runs in $\text{\_\_\_\_\_\_\_\_\_\_}$ .

This problem is a part of the set: Efficient Algorithms .