378 views
0 votes
0 votes
Given a sequence of n real numbers a1,a2,a3,a4…………...an then to find contiguous subsequence Ai,Ai+1,…...Aj.such that its sum is maximum.

How much time the above problem will take if you dynamic program?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Huzaifa0111 asked Aug 27, 2023
157 views
0 votes
0 votes
0 answers
3
Ray Tomlinson asked Aug 9, 2023
268 views
what they want to tell and it is true or false?
0 votes
0 votes
1 answer
4
Ray Tomlinson asked Aug 9, 2023
424 views
How many times is the comparison $i >= n$ performed in the following program?int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }