Question

1) Show the calculation complexity of ciz function as O.

static void ciz(int m) {

    for(int i=1; i<=m; i++)

      System.out.print("X");

}

2) By using the answer to 1, Show the calculation complexity of main function as O.

import java.util.Scanner;

...

public static void main(String[] arg) {

    int n;

    Scanner oku = new Scanner(System.in);

    System.out.print("N=");

    n=oku.nextInt();

    for(int m=1; m<=n; m++) {

      ciz(m);

      System.out.println();

    }

}

Answer 1

1. O(m)

Because the loop runs from 1 to m.

2.

1 + 2 + 3 + 4 + ... + n time loop runs

Above equals to n(n+1) / 2

O(n²)