public void shellSort(int[] s)
{
if (s.Length < 2)
return;
int length = s.Length;
int tmp;
for (int gap = length / 2; gap >= 1; gap /= 2)
{
for (int i = gap; i < length; i++)
{
tmp = s[i];
int j = i - gap;
while (j >= 0 && s[j] > tmp)
{
s[j + gap] = s[j];
j -= gap;
}
s[j + gap] = tmp;
}
}
}
六、希尔排序
最新推荐文章于 2024-09-27 14:28:55 发布