DWORD step;//步进
int *tmpArr = NULL;
if (number < 2)
{
return;
}
tmpArr = (int *)malloc(number*sizeof (int));
if (NULL == tmpArr)
{
printf("分配缓存出错！\n");
getch();
return;
}
for (step=1; step {
index1 = 0;
index2 = index1 + step;
tmpIndex1 = 0;
tmpIndex2 = 0;
i = 0;
while ((index2+tmpIndex2) < number)
{
while ((tmpIndex1 < step) && (tmpIndex2 < step) && ((index2+tmpIndex2) < number))
{
if (arr[index1+tmpIndex1] <= arr[index2+tmpIndex2])
{
tmpArr[i] = arr[index1+tmpIndex1];
tmpIndex1++;
}
else
{
tmpArr[i] = arr[index2+tmpIndex2];
tmpIndex2++;
}
i++;
}
while (tmpIndex1 {
tmpArr[i++] = arr[index1+tmpIndex1];
tmpIndex1++;
}
while ((tmpIndex2 {
tmpArr[i++] = arr[index2+tmpIndex2];
tmpIndex2++;
}
index1 = index1 + 2*step;
index2 = index2 + 2*step;
tmpIndex1 = 0;
tmpIndex2 = 0;
}
memcpy(arr, tmpArr, number*sizeof (int));
}
free(tmpArr);
}
void ExamineArr(const int * const arr, DWORD number)
{
DWORD i=0, j=1;
if (number <2)
{
return;
}
for (; j {
if (arr[i] > arr[j])
{
printf("第%u个数大于第%u个数！\n", i, j);
return;
}
}
}
摘自 kevinshq的专栏