2. The Big-O of the following code fragment is, public void sum (int [] [] x) ( 0; for (int i-0; i < _n; i++) sum = sum + 1; for (int j=0; j < n; j++) sum - sum + x[i][j]; System.out.println (sum); int sum = a. O(n) b. O(n?) c. O(n³) d. O(n)

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 8SA
icon
Related questions
Question
2. The Big-O of the following code fragment is
public void sum (int [] [] x) {
int sum = 0;
for (int i=0; i < n; i++)
sum = sum + 1;
for (int j=0; j < n; j++)
sum + x[i][j];
System.out.println(sum) ;
sum =
a. O(n)
b. O(n?)
C. O(n³)
d. O(n*)
Transcribed Image Text:2. The Big-O of the following code fragment is public void sum (int [] [] x) { int sum = 0; for (int i=0; i < n; i++) sum = sum + 1; for (int j=0; j < n; j++) sum + x[i][j]; System.out.println(sum) ; sum = a. O(n) b. O(n?) C. O(n³) d. O(n*)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning