Challenge 2: Big (O) of Nested Loop with Subtraction

[david-kariuki]

Compute Big(O) of an algorithm that involves nested loops and the loop variables decrement.

public static void main(String[] args) {
    int n = 10; // O(time complexity of the called function)
    int sum = 0; //O(1)
    double pie = 3.14; //O(1)
    
    //O(?)
    for (int var = n; var >= 1; var = var - 3) {
      System.out.println("Pie: " + pie);
      //O(?)
      for (int j = n; j >= 0; j = j - 1) {
        sum++;
      }
    } //end of outer for loop
  System.out.println("Sum: " + sum);//O(1)
  }