algorithms.tutorialhorizon.com
Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer | Algorithms
The max­i­mum sub­ar­ray prob­lem is the task of find­ing the con­tigu­ous sub­ar­ray within a one-dimensional array of num­bers which has the largest sum.