希尔排序C语言描述

希尔排序：

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#include<sys/timeb.h>
#define MAX 10
long getSystemTime()
{
   
        struct timeb tb;
        ftime(&tb);
        return tb.time * 1000 + tb.millitm;
}
//交换函数
void Swap(int *a, int* b)
{
   
        int temp = *a;
        *a = *b;
        *b = temp;
}
//打印函数
void PrintArray(int arr[], int length)
{
   
        for (int i = 0; i < length; i++)
        {
   
               printf("%d ", arr[i]);
        }
        printf("\n");
}
//从小到大 希尔排序
void ShellSort(int arr[], int length)
{
   
        int increasement = length;
        int i,j,k;
        do
        {
   
               //确定分组的增量
               increasement = increasement / 3 + 1;
               for (i = 0; i < increasement; i++)
               {
   
                       for (j = i + increasement; j < length; j += increasement)
                       {
   
                              if (arr[j] < arr[j - increasement])
                              {
   
                                      int temp = arr[j];
                                      for (k = j - increasement; k >= 0 && temp < arr[k];  k -= increasement)
                                      {
   
                                             arr[k + increasement] = arr[k];
                                      }
                                      arr[k + increasement] = temp;
                              }
                       }
               }
        } while (increasement > 1);
}
int main()
{
   
        int arr[MAX];
        srand((unsigned int)time(NULL));
        for (int i = 0; i < MAX; i++)
        {
   
               int randNum = rand() % MAX;
               arr[i] = randNum;
        }
        PrintArray(arr, MAX);
        ShellSort(arr, MAX);
        PrintArray(arr, MAX);
        return EXIT_SUCCESS;
}