The code segment below displays a table of numbers. Select an expression to complete the code segment, so that the resulting algorithm has O(n²) running time. for (int k = 1; k <= n; k++)
{
For _______________________
{
System.out.print(j + " ") ;
}
System.out.println() ;
}

Question

The code segment below displays a table of numbers. Select an expression to complete the code segment, so that the resulting algorithm has O(n²) running time. for (int k = 1; k <= n; k++) { For _______________________ { System.out.print(j + " "); } System.out.println(); } A) (int j = n; j > 0; j = j / 2) B) (int j = 1; j < k; j = j * 2) C) (int j = 0; j < k; j++) D) (int j = 1; j <= 200; j++)

Quizplus · Accepted Answer

The correct answer is C because the inner loop iterates from 0 to k-1, which results in O(n^2) running time.

The Code Segment Below Displays a Table of Numbers