GATE Computer Science (CS) 2017 Shift 2 Solved Paper

Question : 48 of 65

Marks: +1, -0

Consider the following C function.


int fun(int n) {
            int i, j;
            for (i = 1; i < = n; i++) {
            for (j = 1; j < n; j + = i) {
                                    printf (‘’ %d %d’’, i, j);
            }
            }
}

Time complexity of fun in terms of Θ notation is

Θ (n√n)
Θ (n²)
Θ (nlog n)
Θ (n²log n)

Validate

Go to Question:

Prev Question

Next Question