public void InsertSort(int[] s)
{
if (s.Length < 2)
return;
int tmp;
for (int i = 1; i < s.Length; i++)
{
tmp = s[i];
for (int j = i-1; j >=0; j--)
{
if (tmp < s[j])
{
s[j + 1] = s[j];
s[j] = tmp;
}
else
break;
}
}
}
07-24
57万+
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-05
1983
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-23
6200
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
02-22
5591
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
04-29
07-19
220
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交