Question: Let A = {a1, a2, . . . , an} be a sequence of integer numbers. (a) Give an algorithm to find the maximum integer
Let A = {a1, a2, . . . , an} be a sequence of integer numbers.
(a) Give an algorithm to find the maximum integer in A.
(b) Give an algorithm to find the two consecutive elements on A with maximum sum.
(c) Given a natural number k n, design an O(n) algorithm to find k consecutive elements in A with maximum sum.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
