Time Complexity (Big O) - Can value of N decides whether the time complexity is O(1) or O(N) when we have 2 nested FOR loops?

Question

Suppose that I have 2 nested for loops, and 1 array of size N as shown in my code below:

int result = 0;

for( int i = 0; i < N ; i++)
{
    for( int j = i