Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

public int add100(int[ ] array) { if (array.length < 100) { return 0; } int sum = 0; for (int i = 0; i <

public int add100(int[ ] array) {

if (array.length < 100) {

return 0;

}

int sum = 0;

for (int i = 0; i < 100; i++) {

sum += array[i];

}

return sum;

}

What is the running time of the method above?

Q2) Order the following functions by growth rate:

2^n , 26, N^3 , N, N^2 log N, N log N, N^2 , 2/N

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_step_2

Step: 3

blur-text-image_step3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

More Books

Students also viewed these Databases questions