4. Approximate the runtime of the following code fragment, in terms of n: Write your answer...

 

Transcribed Image Text:

4. Approximate the runtime of the following code fragment, in terms of n: Write your answer in a format such as "O(N^2)" or "O(N log N)" (without the quotes). [10 points] int sum = 0; for } (int j = 1; j<n; j++) { sum++; if (j 8 2 == 0) { sum++; } 5. Approximate the runtime of the following code fragment, in terms of n: Write your answer in a format such as "O(N^2)" or "O(N log N)" (without the quotes). [10 points] int sum = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j<= 1000000; j++) { sum + = 10; } } sum +9999; 4. Approximate the runtime of the following code fragment, in terms of n: Write your answer in a format such as "O(N^2)" or "O(N log N)" (without the quotes). [10 points] int sum = 0; for } (int j = 1; j<n; j++) { sum++; if (j 8 2 == 0) { sum++; } 5. Approximate the runtime of the following code fragment, in terms of n: Write your answer in a format such as "O(N^2)" or "O(N log N)" (without the quotes). [10 points] int sum = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j<= 1000000; j++) { sum + = 10; } } sum +9999;

Answer rating: 100% (QA)

Runtime Analysis 4 int sum 0 for int j 1 j n j sum if j 2 0 sum Runtime On Explanation The outer l... View the full answer