DS Algorithm Analysis: Exercises

Section 2.10 Algorithm Analysis: Exercises

Exercises Exercises

1.

Give the Big O performance of the following code fragment:

for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
        int k = i + j;
    }
}

🔗

2.

Give the Big O performance of the following code fragment:

🔗

for (int i = 0; i < n; i++) {
    int k = 2 * i;
}

🔗

3.

Give the Big O performance of the following code fragment:

🔗

int i = n;
while (i > 0) {
    int k = 2 * i;
    i = i / 2;
}

🔗

4.

Give the Big O performance of the following code fragment:

🔗

int result = 0;
for (int i = 0; i < n; i++) {
   for (int j = 0; j < n; j++) {
      for (int k = 0; k < n; k++) {
         result = i + j + k;
      }
   }
 }

🔗

5.

Give the Big O performance of the following code fragment:

🔗

int result = 0;
for (int i = 0; i < n; i++) {
   result = i + i;
}
for (int j = 0; j < n; j++) {
   result = j + j;
}
for (int k = 0; k < n; k++) {
   result = k + k;
}

🔗