Register
Dark Mode

made easy

in Algorithms
267 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?
in Algorithms
by
267 views

3 Comments

by
O(n^2)??
0
0
by

It can be done in O(n) time by using Kadane's algorithm.

https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/

0
0
by
O(n)
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Developed by Chun
Link Copied!