Course: Numerical Optimization
I've checked on answers for this answer but couldn't get anything.
Kindly answer questions a, b & c as seen in the picture.
Course Numerical Optimization I Ve Checked On Chegg For This Answer But Couldn T Get Anything Kindly Answer Questions 1 (84.71 KiB) Viewed 64 times
2. Algorithm analysis (Ex.2.4-4) Consider the following recursive algorithm. ALGORITHM Q(n) //Input: A positive integer n if n = 1 return 1 else return Q(n − 1) + 2 * n − 1 - a. Set up a recurrence relation for this function's values and solve it to deter- mine what this algorithm computes. b. Set up a recurrence relation for the number of multiplications made by this algorithm and solve it. c. Set up a recurrence relation for the number of additions/subtractions made by this algorithm and solve it.
Register for solutions, replies, and use board search function. Answer Happy Forum is an archive of questions covering all technical subjects across the Internet.