Solution Review: Nested Loop with Multiplication (Advanced)

Explore how to analyze time complexity in nested loops where one loop multiplies by two each iteration. Understand applying Big O notation in C# to determine overall performance, including logarithmic components and factorial expressions.

We'll cover the following...

- Solution
- - Time complexity

namespace Chapter_1
{
    class Challenge_6
    {
        static void Main(string[] args)
        {
            int n = 10;    //O(1) 
            int sum = 0;   //O(1) 
            float pie = 3.14f; //O(1) 
            for (int i = 0; i < n; i++) //O(n)
            {
                int j = 1; //O(n)
                Console.WriteLine(pie); //O(n)
                while (j < i)// O((n) * (log2 var))
                {
                    sum += 1; // O((n) * (log2 var))
                    j *= 2; // O((n) * (log2 var))
                }
            }
            Console.WriteLine(sum); //O(1) 
        }
    }
}

1.Introduction to Complexity Measures

2.Introduction to Arrays

3.Introduction to Linked Lists

4.Introduction to Stack/Queues

5.Introduction to Graphs

6.Introduction to Trees

7.Trie

8.Introduction to Heap

9.Introduction to Hashing

10.Summary of Data Structures

Solution Review: Nested Loop with Multiplication (Advanced)

Solution