C ++ Programming Beauty - Digital Charm (Listing 2-24)

Listing 2-24

int MaxSum(int* A, int n)
{
     int maximum = -INF; 
     int sum;
     for(int i = 0; i < n; i++)
     {
          for(int j = i; j < n; j++)
          {
               for(int k = i; k <= j; k++)
               {
                    sum += A[k];
               }
               if(sum > maximum)
                    maximum = sum;
          }
     }
     return maximum;
}