Question

What is the time complexity of the following algorithm? 
int func(int n) { 
       for (int i = 1; i < = n; i++) { 
              for (int j = 1; j < = n; j++) { 
                  printf("Hello"); 
               } 
            } 
        } 

• A. O(n)
• B. O(n²)
• C. O(n³)
• D. O(log n)

Hint:

To determine the time complexity of an algorithm, consider the number of iterations of each loop. The time complexity for nested loops is the product of the iterations.

Answer 1

The Correct Option is B

Understanding the Algorithm 
- The outer loop runs n times. 
- The inner loop also runs n times for each iteration of the outer loop. 
- The total number of executions of the `printf` statement is \( n \times n = n^2 \). 

Thus, the time complexity of the algorithm is O(n²).