#3 [ 3 points]

Given the following piece of code, choose the Big Oh complexity. (If there is more than one option, choose the tightest asymptotic bound.)

p = 0;

for (int j=0; j < n; j++) {

if (a[j] != 0) {

p = p + a[j];

}

}

return p;

where n is a positive integer and array a[] has all float values.

Select one:

a. O(n2)

b. O(1)

c. O(n)

d. O(log n)