归并排序(C#实现)

博客中代码都经过运行并且没有bug

    //用作排序的数组，其中数组第一个元素用来记录数组长度，不进行排序
    private static int[] sortArray = { 10, 40, 55, 49, 73, 12, 27, 98, 81, 64, 36 };

    private static int[] Msort(int[] SR, int[] TR1, int s, int t)
    {
      if (s == t)
      {
        TR1[s] = SR[s];
      }
      else
      {
        int m = (s + t) / 2;//将SR[s...t]评分为SR[s...m]和SR[m+1...t]
        int[] TR2 = new int[SR.Length];
        Msort(SR, TR2, s, m);//递归地将SR[s...m]归并为有序的TR2[s...m]
        //ShowSortArray(test, s, m);
        Msort(SR, TR2, m+1, t);//递归地将SR[m+1...t]归并为有序的TR2[m+1...t]
        Merge(TR2,TR1,s,m,t);
      }
      return TR1;
    }

    private static void Merge(int[] SR, int[] TR, int i, int m, int n)
    {
      int j = 0, k = 0;
      for (j=m+1,k= i;i<=m&&j<= n;k++)
      {
        //将SR中记录由小到大地并入TR
        if (SR[i] <= SR[j])
        {
          TR[k] = SR[i++];
        }
        else
        {
          TR[k] = SR[j++];
        }
      }
      if (i <= m)
      {
        while (k <= n && i <= m)
        {
          TR[k] = SR[i];
          ++k;
          ++i;
        }
      }
      if (j <= n)
      {
        while (k <= n && j <= n)
        {
          TR[k] = SR[j];
          ++k;
          ++j;
        }
      }

    }

    private static void ShowSortArray(int[] array,int low,int high)
    {
      for (int i = low; i <= high; i++)
      {
        Console.Write(array[i] + " ");
      }
      Console.WriteLine();
    }

    static void Main(string[] args)
    {
      int[] TR1 = new int[11];
      TR1 = Msort(sortArray,TR1,1,10);
      ShowSortArray(TR1,1,10);

      Console.ReadKey();
    }

时间复杂度T(n)=O(nlogn)