Search⌘ K
AI Features
Home
Courses
Algorithms for Coding Interviews in C#

Solution: Big O of a Nested Loop with Addition

Explore how to determine the time complexity of nested loops that increment by addition in C#. This lesson helps you understand the Big O notation for such loops, enabling you to analyze and optimize algorithm performance for coding interviews.

We'll cover the following...

Solution #

C# 9.0
int n = 10; // 'n' can be anything, this is just an example
int sum = 0;
double pie = 3.14;
for (int var = 1; var < n; var += 3)
{
    System.Console.WriteLine(pie);
    for (int j = 1; j < n; j += 2)
    {
        sum += 1;
        System.Console.WriteLine(sum);
    }
}

Explanation

The for (int var = 1; var < n; var += 3) line gets executed n3\frac{n}{3} times ...