Solution #

Node.js

// Initializations
const n = 10;
const pie = 3.14;
let sum = 0;
var i = 1;
while (i < n) {
    console.log(pie);
    for (var j = 1; j < n; j += 2) {
        sum = sum + 1;
    }
    i *= 3;
}
console.log(sum)

Time Complexity

The outer loop in this problem runs $log_3(n)$ times since i will first be equal to $1$ , then $3$ , then 6, then $9,\cdots$ , until it is $3^k$ such that $3^k < n$ . In the inner loop, var j=1; runs $log_3(n)$ times, j<n gets executed $log_3(n)\times(\frac{n}{2}+1)$ times and j+=2 executed $log_3(n)\times\frac{n}{2}$ times. The sum+=1; line also runs a total of $log_3(n)\times\frac{n}{2}$ ...

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

Mock Interview

Data Structures

Solution: Nested Loop With Multiplication (Basic)

Solution #

Time Complexity