/// <summary>
/// 插入排序
/// 从第2个数开始,跟第一个数对比,放在左边还是右边
/// 循环下去比较,都放在合适的位置
/// </summary>
/// <param name="arr"></param>
public static void InsertionSort(this int[] arr)
{
int inner, temp;
for (int outer = 1; outer < arr.Length; outer++)
{
temp = arr[outer];
inner = outer;
while (inner > 0 && arr[inner - 1] >= temp)
{
arr[inner] = arr[inner - 1];
inner -= 1;
}
arr[inner] = temp;
arr.Show();
}
}
标签:10,arr,outer,temp,int,插入排序,inner From: https://www.cnblogs.com/billzhjh/p/17035577.html