【初阶数据结构】深度解析七大常见排序|掌握底层逻辑与原理（一）

#pragma once
#include <time.h>
#include<stdlib.h>
#include <stdio.h>
// 排序实现的接口
// 插入排序
void InsertSort(int* a, int n);
// 希尔排序
void ShellSort(int* a, int n);
// 选择排序
void SelectSort(int* a, int n);
// 堆排序
void AdjustDwon(int* a, int n, int root);
void HeapSort(int* a, int n);
// 冒泡排序
void BubbleSort(int* a, int n)
// 快速排序递归实现
// 快速排序hoare版本
int PartSort1(int* a, int left, int right);
// 快速排序挖坑法
int PartSort2(int* a, int left, int right);
// 快速排序前后指针法
int PartSort3(int* a, int left, int right);
void QuickSort(int* a, int left, int right);
// 快速排序 非递归实现
void QuickSortNonR(int* a, int left, int right)
// 归并排序递归实现
void MergeSort(int* a, int n)
// 归并排序非递归实现
void MergeSortNonR(int* a, int n)
// 计数排序
void CountSort(int* a, int n)
// 测试排序的性能对比
void TestOP()
{
    srand(time(0));
    const int N = 100000;
    int* a1 = (int*)malloc(sizeof(int) * N);
    int* a2 = (int*)malloc(sizeof(int) * N);
    int* a3 = (int*)malloc(sizeof(int) * N);
    int* a4 = (int*)malloc(sizeof(int) * N);
    int* a5 = (int*)malloc(sizeof(int) * N);
    int* a6 = (int*)malloc(sizeof(int) * N);
    for (int i = 0; i < N; ++i)
    {
        a1[i] = rand();
        a2[i] = a1[i];
        a3[i] = a1[i];
        a4[i] = a1[i];
        a5[i] = a1[i];
        a6[i] = a1[i];
    }
    int begin1 = clock();
    InsertSort(a1, N);
    int end1 = clock();
    int begin2 = clock();
    ShellSort(a2, N);
    int end2 = clock();
    int begin3 = clock();
    SelectSort(a3, N);
    int end3 = clock();
    int begin4 = clock();
    HeapSort(a4, N);
    int end4 = clock();
    int begin5 = clock();
    QuickSort(a5, 0, N - 1);
    int end5 = clock();
    int begin6 = clock();
    MergeSort(a6, N);
    int end6 = clock();
    printf("InsertSort:%d\n", end1 - begin1);
    printf("ShellSort:%d\n", end2 - begin2);
    printf("SelectSort:%d\n", end3 - begin3);
    printf("HeapSort:%d\n", end4 - begin4);
    printf("QuickSort:%d\n", end5 - begin5);
    printf("MergeSort:%d\n", end6 - begin6);
    free(a1);
    free(a2);
    free(a3);
    free(a4);
    free(a5);
    free(a6);
}

void InsertSort(int* a, int n)
{
  //[0,end] end+1//下标的意思
  //循环结束的条件 end>0或者找到插入目标
  //end从0开始[0,0]
  for (int i = 0; i < n - 1; i++)
  {
    int end = i;
    int tmp = a[end + 1]; 
    while (end >= 0 && tmp < a[end])//当出现大于前面有序的数据停下，>就是倒过来
    {
      a[end + 1] = a[end];
      end--;
    }
    a[end + 1] = tmp;
  }
};

int gap=3;//规定每隔三个空为一组，单独插入排序
for(int j=0;j<gap;j++)//一共有三组
{
  for(int i=j;i<n-gap;i+=gap)//每一组之间的插入排序
    {
        int end=i;
        int tmp=a[end+gap];
        while(end>=0)
        {
      if(tmp<a[end])
            {
                a[end+gap]=a[end];
                end-=gap;
            }
            else
                break;
        }
        a[end+gap]=tmp;
    }
}

int gap=3;//规定每隔三个空为一组，单独插入排序
  for(int i=j;i<n-gap;i++)//多个组同时排序
    {
        int end=i;
        int tmp=a[end+gap];
        while(end>=0)
        {
      if(tmp<a[end])
            {
                a[end+gap]=a[end];
                end-=gap;
            }
            else
                break;
        }
        a[end+gap]=tmp;
    }

int gap = n;
  while (gap > 1)
  {
        //gap不断发生变换
    gap =gap / 3 + 1;
    for (int i = 0; i < n - gap; i++)//多组
    {
      int end = i;
      int tmp = a[end + gap];
      while (end >= 0 && tmp < a[end])
      {
        a[end + gap] = a[end];
        end -= gap;
      }
      a[end + gap] = tmp;
    }
  }
}