The complexity for the following code is int fun (int n) for (int i = 1;...

  

Transcribed Image Text:

The complexity for the following code is int fun (int n) for (int i = 1; i <= n; i++) %3D for (int j = 1; j < n; j += i) %3D { // Some O (1) task Select one: 21 a. O(n gn) b. O(nlgn) O . (n) d. O(n) The complexity of the following code is void f(int n) { if (n > 0) { DoSomething (n); // o (n) f (n-1); } } Select one: a. O(nlgn) b. O(n) c. O(gn) d. O(n) The complexity for the following code is int fun (int n) for (int i = 1; i <= n; i++) %3D for (int j = 1; j < n; j += i) %3D { // Some O (1) task Select one: 21 a. O(n gn) b. O(nlgn) O . (n) d. O(n) The complexity of the following code is void f(int n) { if (n > 0) { DoSomething (n); // o (n) f (n-1); } } Select one: a. O(nlgn) b. O(n) c. O(gn) d. O(n)

Answer rating: 100% (QA)

1 b Onlgn 2 b On2 Explanation 1 When i 1 the inner j loop r... View the full answer