C# insertion method sorting algorithm example analysis

This article describes the C# insertion sorting algorithm. Share it for your reference. The details are as follows:

public static void InsertSort (int[] list)
{
  for (int i = 1; i < ; i++)
  {
    int Temp = list [i];
    int j = i - 1;
    while (j > = 0 && list [j] > Temp)
    {
      list [j + 1] = list [j];
      j-;
    }
    list [j + 1] = Temp;
  }
}

I hope this article will be helpful to everyone's C# programming.