A nested loop puzzle

Which of the following two code segments is faster? Assume that compiler makes no optimizations.

filter_none

edit
close

play_arrow

link
brightness_4
code

/* FIRST */
for(i=0;i<10;i++)
  for(j=0;j<100;j++)
    //do somthing

chevron_right


filter_none

edit
close

play_arrow

link
brightness_4
code

/* SECOND */
for(i=0;i<100;i++)
  for(j=0;j<10;j++)
    //do something

chevron_right


Both code segments provide same functionality, and the code inside the two for loops would be executed same number of times in both code segments.
If we take a closer look then we can see that the SECOND does more operations than the FIRST. It executes all three parts (assignment, comparison and increment) of the for loop more times than the corresponding parts of FIRST:

  1. The SECOND executes assignment operations ( j = 0 or i = 0) 101 times while FIRST executes only 11 times.
  2. The SECOND does 101 + 1100 comparisons (i < 100 or j < 10) while the FIRST does 11 + 1010 comparisons (i < 10 or j < 100).
  3. The SECOND executes 1100 increment operations (i++ or j++) while the FIRST executes 1010 increment operation.

Below C++ code counts the number of increment operations executed in FIRST and SECOND, and prints the counts.

filter_none

edit
close

play_arrow

link
brightness_4
code

//program to count number of increment 
//operations in FIRST and SECOND 
#include<iostream>
  
using namespace std;
  
int main()
{
  int c1 = 0, c2 = 0;
     
  /* FIRST */
  for(int i=0;i<10;i++,c1++)
    for(int j=0;j<100;j++, c1++);
      //do something
  
     
  /* SECOND */
  for(int i=0; i<100; i++, c2++)
      for(int j=0; j<10; j++, c2++);
        //do something
  
  cout << " Count in FIRST = " <<c1 << endl;
  cout << " Count in SECOND  = " <<c2 << endl;
  
  getchar();
  return 0;
}

chevron_right


Output:

Count in FIRST = 1010
 Count in SECOND  = 1100

Below C++ code counts the number of comparison operations executed by FIRST and SECOND

filter_none

edit
close

play_arrow

link
brightness_4
code

//program to count the number of comparison 
//operations executed by FIRST and SECOND */
#include<iostream>
  
using namespace std;
  
int main()
{
   int c1 = 0, c2 = 0;
      
   /* FIRST */
   for(int i=0; ++c1&&i<10; i++)
      for(int j=0; ++c1&&j<100;j++);
     //do something
  
   /* SECOND */
   for(int i=0; ++c2&&i<100; i++)
      for(int j=0; ++c2&&j<10; j++);
      //do something
  
   cout << " Count fot FIRST  " <<c1 << endl;
   cout << " Count fot SECOND  " <<c2 << endl;
   getchar();
   return 0;
}

chevron_right


Output:

Count fot FIRST  1021
 Count fot SECOND  1201

Thanks to Dheeraj for suggesting the solution.

Please write comments if you find any of the answers/codes incorrect, or you want to share more information about the topics discussed above.



My Personal Notes arrow_drop_up


Article Tags :
Practice Tags :


3


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.