Question: Consider the following algorithm: int j = 1; int k = 1; for (i = 1; i

Consider the following algorithm:

int j = 1;

int k = 1;

for (i = 1; i <= 10; i++)

j = j * 100; consider this a basic operation

for (i = 1; i <= 20; i++)

k = k * 2; consider this a basic operation

What is the running time, T(n)? Give both the exact function T(n), and then give a big- Theta estimate of T(n). Show your work. For example, if T(n) is exactly n2 + 3n, then T(n) is big-Theta of n2. Show your work! (10 pts.)

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!

1 question) Arrange the following in the order of their growth rates, from least to greatest: (5 pts) n 3 n 2 n n lg n n! n lg n 2 n n 2 question)Show that 3n 3 + n 2 is big-Oh of n 3 . You can use...

4. Consider the following algorithm: int j = 1; int k= 1; for (i = 1; i

Consider the following statements: int i = 1 ; int k = 2 ; int * p 1 ; int * p 2 ; p 1 = &i; p 2 = &k; p 1 = p 2 ; * p 1 = 3 ; * p 2 = 4 ; cout

1) Show that 6n 2 + 20n is big-Oh of n 3 , but not big-Omega of n 3 . You can use either the definition of big-Omega (formal) or the limit approach 2) Show that n 3 is big-Omega of n 2 . You can use...

(36) Consider the following algorithm: int any equal (int n, int A[]) index i, j, k , m; for (i = 1; i 1)? (b) What is the worst case time complexity of the algorithm? (c) Try to improve the...

Consider the following algorithm: int i , j , k = 0 ; for ( i = n / 2 ; i

What is the time complexity of the nested loops below? Assume n is a power of 2 . i = n; while ( i > = 1 ) { j = i; while ( j = n ) { / / Needs T ( 1 ) j = 2 * j; } i = ? i / 2 ? ; } Consider the...

35. Consider the following algorithm: int add_them (int n, int A[]) { index i, j, k, j = 0; for (i = 1; i

Consider the following algorithm: int add_them (int n, int A []) {index i, j k; j = 0; for (i = 1; i

Consider the following algorithm. ALGORITHM Enigma(A[0..n - 1, 0..n-1])) for j = 0 to n - 2 do for k = j + 1 to n - 1 do if A[j, k] notequalto A[k, j] return false return true a. What does this...

Johnny just purchased a new hybrid car costing $40,000. He put down $10,000 of savings and borrowed the remaining $30,000 from his credit union at a 6% annual rate of interest over a 5-year period....

PART B: 8% - Simulation Reflection & Analysis Prepare an 800-1200 word discussion/analysis. Use Times New Roman 12 point font, 1.5 or double spaced, 1 margins. Separate your discussion into...

The portion of a mortgage payment that is applied to the principal increases quickly in the early years of the loan. Question 6 options: TrueFalse

2. Show that, for TE

In an Excel Pivot Table, how is a Fact/Measure Column repeated?

In Gender Pay Equity Studies in the Federal Service, how can comparisons be ensured across Job of Comparable Worth?

In the Federal Evaluation System (FES), what standards are used in the Job Evaluation Process?