Question: Hi I am new to java and was given this problem. 1 . Each of the following are formulae for the number of operations in

Hi I am new to java and was given this problem.

1 . Each of the following are formulae for the number of operations in some algorithm. Express each formula in big-O notation.

A. 1024n + n2

B. The number of times n can be divided by 100 before dropping below 1.0

C. The number of digits in 5n2

D. (n+7)(n-2)( n2 + 5n2)

E. n2 + 5n2

2. A. Write the algorithm (not code) for a method that computes sum of the square of the numbers in an array. If the array's length is zero, the sum should be zero. B. Do a big-O analysis of your algorithm.

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!