QUESTION 9 Algorithm 1 has the time-complexity function fn) = 100000n/n +n. and Algorithm 2 has the time-complexity function f2(n)=nyn+1000000log,(n). Under very large input n, which of the following statements is true? O Algorithm 1 is slower than Algorithm 2. The two algorithms are equally fast. We cannot tell from the given information. Algorithm 2 is slower than Algorithm 1.

QUESTION 9 Algorithm 1 has the time-complexity function fn) = 100000n/n +n. and Algorithm 2 has the time-complexity function f2(n)=nyn+1000000log,(n). Under very large input n, which of the following statements is true? O Algorithm 1 is slower than Algorithm 2. The two algorithms are equally fast. We cannot tell from the given information. Algorithm 2 is slower than Algorithm 1.

Algebra and Trigonometry (6th Edition)

6th Edition

ISBN:9780134463216

Author:Robert F. Blitzer

Publisher:Robert F. Blitzer

ChapterP: Prerequisites: Fundamental Concepts Of Algebra

Section: Chapter Questions

Problem 1MCCP: In Exercises 1-25, simplify the given expression or perform the indicated operation (and simplify,...

See similar textbooks

Similar questions

QUESTION 13 What is the time complexity function of the following algorithm? 1. Input strings ... and y... n and s 2. For 1 ton do 2.1. If zs then 2.1.1. Return "String one contains s." 3. For i 1 ton do 3.1. If ys then 3.1.1. Return "String two contains s." 4. Return "Neither string contains s." af(n) =n b. n²-n f(n) = 2 Ocf(n)=2n d.f(n) =n² QUESTION 14 What is the time complexity function of the following algorithm? 1. Input string ..... In. 2. For i 1 ton-1 do 2.1 For j=i+1 ton do 2.1.1 If = then 2.1.1.1 Return "There is duplicate integer in the string." 3. Return "There are no duplicate integers in the string." a. f(n) = 2n b. n²-n f(n) = 2 f(n) =n² d.f(n) =n
Consider the Fixed Point iteration algorithm defined by the formula za+1 = 9(In), where g(z) = I- a+ 2ae. Here a eR is a parameter. (a) Find the fixed point, p. (b) Does there exist a value of a for which the iterations could converge quadratically? If yes, find it and explain your answer.
CLO3: The following graph represents the growth functions of two different algorithms. Use the graph to answer the questions follow: Function's Growth 140 120 100 80 60 20 1 2 3 4 5 6 7 9 10 11 8 FF-5*x+14 for agor thm B Gx)= x*2 for algorithm A 1) Which algorithm, A or B, performs better when (problem size) n is less than 7? (a 2) Which algorithm, Aor B, performs better when (problem size) n is greater than 7? 3) What can you conclude about the performance of the two algorithms when (problem size) n= 7?
QUESTION 10 An algorithm has time complexity f(n)%3Dn*+200x+10000. Of is O(1) Of is O(n?) Of is O(n*) Of is O(n°)
Question 4 (rtimavaav. Parts (b) and (9) before starting on this problems. In the following we will consider permutations of (10] as orderings of the elements of (10] rather than as functions. 3). You might want to review Homework 1 Question 3 (a) How many permutations of (10] are there that EITHER alternate even and odd numbers or have even numbers in the first 5 positions?? (b) How many permutations of (10] are there that EITHER alternate even and odd numbers of have the numbers 1, 2, 3, 4, and 5 (in some order) in the first 5 positions?
we have an iterative algorithm where our first two approximations are r = 1 and Suppose 2 and each subsequent approximation is the average of the two previous approximations En0.5(r-+xn-2) for each n 2 3. Find the relative approximate error for r2, T3, and r4 i.e I2
URGENT!!! Solve EACH STEP PROPERLY PLEASE !!!
Help me fast with detail explanation. Definitely I will give Upvote.
Need help with discrete structures
8
Consider the following equation: x² - 2xe* + e?* = 0. A numerical algorithm produced the following approximation of a root r of this equation x, = 0.567143470743. How much is the backward error (give the answer with one significant digit) ? Estimate the multiplicity of the root the algorithm is trying to approximate : Estimate the absolute error |r- x,| of x, to one significant digit: How many correct significant digits contains x, ?
I really appreciated it if you could help me with those questions; thank you