Question: Question 1 Design and analyze the following algorithms: (a) Given n integersbh rie an algorithm to calculate ,-23,+nb The algorithm head line can be procedure
Question 1 Design and analyze the following algorithms: (a) Given n integersbh rie an algorithm to calculate ,-23,+nb The algorithm head line can be procedure Calculation(int b.n) (b) Explain why what you wrote in (a) is an algorithm. (c) How many additions does your algorithm need? (d) To solve the same problem with size n, algorithm A uses-fin) = 100 +100, +100 operations, and algorithm B uses g(n) = n." +1 operations. Answer the following questions: (i) Which algorithm runs fast when n is large enough?(ii) What are the Big-O of J(n) and g(n), respectively
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
