Skip to content

Latest commit

 

History

History

Largest Sum Contiguous Subarray

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 
 
 

Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum.

For Example : Array = {-2, -3, 4, -1, -2, 1, 5, -3};

Maximum contiguous sum is 7

Starting index 2

Ending index 6