算法 - 时间复杂度

int i = 8;
int j = 6;
int sum = i + j;

i=1;
while (i <= n)  {
  i = i * 2;
}

int cal(int m, int n) {
  int sum_1 = 0;
  int i = 1;
  for (; i < m; ++i) {
    sum_1 = sum_1 + i;
  }

  int sum_2 = 0;
  int j = 1;
  for (; j < n; ++j) {
    sum_2 = sum_2 + j;
  }

  return sum_1 + sum_2;
}