Test by Bikram | Algorithms | Test 2 | Question: 12

Question

The time complexity of the function mentioned below is:

void f(int k[], int n)
{
int i;
printf("%d",n);
for(i=0; i<n; i++)
{
printf("%d",k[i]);
}
printf("n");
}

• A. $O(n^2)$
• B. $O(n \log n)$
• C. $O(n)$
• D. $O(n^3)$

Answer 1

Time Complexity of a loop is considered as O(n) if the loop variables is incremented / decremented by a constant amount.

For example following functions have O(n) time complexity-

// Here c is a positive integer constant   
   for (int i = 1; i <= n; i += c) {  
        // some O(1) expressions