title: Tricky nested loop O(n+m)?
body: <p><strong>I did not quite understand how does this loop works :</strong> </p>
  
  <pre><code> for(int i = 0, j = 0; i &lt; n; i++){
          for(; j &lt; m; j++){
  </code></pre>
  
  <p>more Appropriate exemple</p>
  
  <pre><code>int arr[] = {1, 2, 3, 4, 5, 6, 7};
  int arr1[] = {7, 6, 5, 4, 3, 2, 1};
  for (int i = 0, j = 0; i &lt; n; i++) {
    for (; j &lt; m; j++) {
      if (arr[i] + arr1[j] &lt; 0) break;
      if (arr[i] + arr1[j] &gt; max) max = arr[i] + arr1[j];
    }
  }
  </code></pre>
  
  <p>when the loop starts do they work simultaneously ?like thi like [[1+7][2+6][3+5] etc.....], means  as it increment they both make sum</p>
  
  <p>or does work like nested loops </p>
  
  <p>and what if we break or made continue in the second loop what would happen?
  well detailed and more informations and explanation would be appreciated</p>