Question: Hi i am taking a java class and I am stuck on this question What is the big-O of the following code fragment? int sum

Hi i am taking a java class and I am stuck on this question

What is the big-O of the following code fragment?

int sum = 0;

for(int i = 0; i <= n; i++)

for (int j = m ; j > = 0; j--)

sum = sum + (Math.pow(i,2) * Math.pow(j,2));

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!