John F. Bergin               

Bellevue, WA

(425) 242-1394

John.F.Bergin@Comcast.net                            Resume

Word Formatted Resume (Right Click and "Save Target As")

Cover Letter                                                    White Papers                                            Code Examples

Senior Software Engineer                                                                                                                                                                                                          

Code Examples by John F. Bergin

    Print Maximum Sum Sequence

    The following program prints the maximum sum of consecutive integers from an array of integers:

    // Find Max Sum Sequence

    static bool MaxSumSequence( int *inputArray,

  int inSize,

                                int *outputArray,

  int *outSize,

  int *maxSum)

    {

         int startLoc = 0;

         int endLoc = 0;

         int largestSum = 0;

         int sum = 0;

         int i,j;

         // Find Largest Sum and Start and End locations in array

         for ( i=0;i<inSize;i++)

         {

           sum = 0;

           for ( j=i;j<inSize;j++)

           {

                sum += inputArray[j];

                if ( sum > largestSum )

                {

                     largestSum = sum;

                     startLoc = i;

                     endLoc = j;

                }

           }

         }

      // Populate Output Array and calculate Max Sum

       *outSize = endLoc - startLoc + 1;

     *maxSum = 0;

    i=startLoc;

    j=0;

    for ( i=startLoc;i<=endLoc;i++)

    {

        outputArray[j] = inputArray[i];

        j++;

        *maxSum += inputArray[i];

    }

 

    return 0;

    };

    The following Test Window shows the results of a test of the "Maximum Sum Sequence" program:

____________________________

Copyright © 2010 by John F. Bergin.

Home