C#实现插入排序算法实例

public void Sort(int[] data)
{
  insertOnSort(data,1);
}
private void insertOnSort(int[] data, int index)
{
  if (index < data.Length)
  {
 int t=data[index];
 for (int i = index - 1; i >= 0; i--)
 {
   if (data[i] > t)
   {
 data[i + 1] = data[i];
 data[i] = t;
   }
   else
   {
 data[i + 1] = t;
 break;
   }
 }
 insertOnSort(data, index + 1);
  }
}