...
/Solution Review: Big (O) of Nested Loop with Addition
Solution Review: Big (O) of Nested Loop with Addition
This review provides a detailed analysis of the time complexity of the "Nested Loop with Addition" problem!
We'll cover the following...
Solution
Press + to interact
namespace Chapter_1{class Challenge_1{static void Main(string[] args){int n = 10;int sum = 0;float pie = 3.14F;for (int i = 0; i < n; i += 3) // O(n/3){Console.WriteLine(pie); // O(n/3)for (int j = 0; j < n; j += 2) // O((n/3)*(n/2)){sum += 1; // O((n/3)*(n/2))Console.WriteLine(sum); // O((n/3)*(n/2))}}}}}
On line 11 in the outer loop, int i=0;
runs once. i<n;
gets executed times, and i+=3
executed ...