Question

Demonstrate in a small code snippet O(n^2) (n to the power of 2)

Please code in Java

Answer 1

//TestCode.java
import java.util.Scanner;
public class TestCode {
  public static void main(String args[]){
    int n;
    Scanner scanner = new Scanner(System.in);
    System.out.print("Enter value for n: ");
    n = scanner.nextInt();
    for(int i = 0;i<n;i++){
      for(int j = 0;j<n;j++){
        System.out.print("*");
      }
      System.out.println();
    }
  }
}

===================================

Each loop is running for n times.

So, time complexity = O(n*n)