Solution: Big (O) of a Nested Loop with Subtraction
This review provides a detailed analysis of the different ways to solve the nested loop with a subtraction challenge.
We'll cover the following...
Given code
Press + to interact
class NestedLoop {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)for (int var = n; var >= 1; var = var - 3) { // O(n/3)System.out.println("Pie: " + pie); // O(n/3)for (int j = n; j >= 0; j = j - 1) { // O((n/3)*(n+1))sum++; // O((n/3)*(n+1))}} //end of outer for loopSystem.out.println("Sum: " + sum);//O(1)} //end of main} //end of class
Solution breakdown
On line 8, in the outer loop, int var=n;
runs once, var>=1;
gets executed ...
Access this course and 1400+ top-rated courses and projects.