Data Structures for Coding Interviews in C++/

...

/

Example: Time Complexity of an Algorithm With Nested Loops

Example: Time Complexity of an Algorithm With Nested Loops

In this lesson, we will learn how to compute the time complexity of an algorithm that involves nested for loops.

We'll cover the following...

In the previous lesson, we learned how to calculate the time complexity of an algorithm that involves a loop. Now, we’ll extend the same idea to analyzing an algorithm with nested for loops.

A Program With Nested for Loops #

Consider the following C++ program:

Press + to interact
int main(){
  int n = 5;
  int m = 7;
  int sum = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++)
      sum += 1;
  }
  cout << sum;
  return 0;
}

It is a simple piece of code that prints the number of times the increment statement runs throughout the program. Let’s compute its time complexity.

Time Complexity

Let’s take the training wheels off and jump straight to line number 5. From the previous lesson, you would recall that it accounts for ...

Access this course and 1400+ top-rated courses and projects.