Tag: Largest subarray with highest sum

Given an array of size n with integer values. Write a program to find the subarray having largest sum.

For eg:
Input array — int arr[] = {3,-1,-4,4,-1,2,1,-5,4}
Largest subarray sum – {4,-1,2,1} = 6