Question

Write a code using c# Maximum Sub Array.

Answer 1

CODE

using System;

class Exercise

{

  static int maxSubArraySum(int []a)

  {

    int size = a.Length;

    int max_so_far = int.MinValue,

      max_ending_here = 0;

    for (int i = 0; i < size; i++)

    {

      max_ending_here = max_ending_here + a[i];

      

      if (max_so_far < max_ending_here)

        max_so_far = max_ending_here;

      

      if (max_ending_here < 0)

        max_ending_here = 0;

    }

    

    return max_so_far;

  }

  public static void Main ()

  {

    int [] a = {4, -1, 8, 3, 1, -9, 10, 11, 12, 1, -8};

    Console.Write("Maximum contiguous sum is " + maxSubArraySum(a));

  }

}