快速排序中运用插入排序算法

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>

#define K 3
void PrintArr(int *pnArr, int nLen)
{
    for (int i = 0; i < nLen; i++)
    {
        printf("%d ", pnArr[i]);
    }
    printf("\n");
}

void Swap(int *p1, int *p2)
{
    int nTmp = *p1;
    *p1 = *p2;
    *p2 = nTmp;
}

int Partition(int *pnArr, int nLeft, int nRight)
{
    int nKey = nRight;
    int i = nLeft - 1;
    for (int j = nLeft; j < nRight; j++)
    {
        if (pnArr[j] < pnArr[nKey])
        {
            i++;
            Swap(&pnArr[i], &pnArr[j]);
        }
    }
    Swap(&pnArr[i+1], &pnArr[nRight]);

    return i + 1;
}
int RandomPartition(int *pnArr, int nLeft, int nRight)
{
    srand(time(NULL));
    int n1 = rand()%(nRight - nLeft + 1) + nLeft;
    int n2 = rand()%(nRight - nLeft + 1) + nLeft;
    int n3 = rand()%(nRight - nLeft + 1) + nLeft;
    int nKey = (n1+n2+n3) / 3;
    Swap(&pnArr[nKey], &pnArr[nRight]);               //   优化的随机方法选择随机点，进行选择边界点

    return Partition(pnArr, nLeft, nRight);
}

void InsertSort(int *pnArr, int nLeft, int nRight)
{
    for (int i = nLeft + 1; i <= nRight; i++)
    {
        int nTmp = pnArr[i];
		int j;
        for (j = i; j > nLeft && nTmp <pnArr[j-1]; j--)
        {
            pnArr[j] = pnArr[j-1];
        }
        pnArr[j] = nTmp;
    }
}
void QuickSort(int *pnArr, int nLeft, int nRight)
{
    if (nLeft < nRight)
    {
        if (nRight - nLeft > K)
        {
            int nTmpPos = RandomPartition(pnArr, nLeft, nRight);

            QuickSort(pnArr, nLeft, nTmpPos - 1);
            QuickSort(pnArr, nTmpPos + 1, nRight);
        }
        else
        {
            InsertSort(pnArr, nLeft, nRight);//当宽度小于3时，进行插入排序
        }
        
    }
}
int main()
{
    int nArr[10] = {42,1,3,2,16,9,10,14,8,17}; 
    
    PrintArr(nArr, 10);
    QuickSort(nArr, 0,9);

    PrintArr(nArr, 10);
    system("pause");
    return 0;
}