1   int  maxSubSum( const int  *a,  int  n )
    2   {   int  maxSum = 0 ;count++
    3       for  ( int  i = 0 ;  i < n ;  i++)
                 {  count++
    4          for  ( int  j = 0 ;  j < n ;  j++)
                  Count++
    5          {    int   thisSum = 0 ; count++
    6               for (int  k = i ;  k < j ;  k++)
                      Count++
    7                 { thisSum = thisSum + a[k] ; }count++
    8               count++
if ( thisSum > maxSum )
    9                 { maxSum = thisSum ;}count++
   10          }count++
   11
}count++
Count++
return  maxSum ;
   12   }