C语言递归实现快速排序，希望大家帮我改一下bug，然后写一下出现bug的具体原因，细一点，谢啦

Question

#include <stdio.h>
#include <time.h>
#define N 100
void Swap(int *p, int *q);
int Median3(int A[], int Left, int Right);
void QuickSort(int A[],int Left, int Right);
void Println(int A[], int Len);
int main() {
int A[N] = {0};
int i, len;//
printf("请输入数组长度：\n");
scanf("%d",&len);// printf("请输入数组元素：\n");
for(i = 0; i < len; i++) { scanf("%d",&A[i]); }
QuickSort(A,0,len-1);
Println(A,len); return 0;}
void Swap(int *p, int *q) { int temp = *p; *p = *q; *q = temp; }
int Median3(int A[], int Left, int Right) {
int Center = (Left + Right)/2;
if(A[Left] > A[Center]) {
Swap(&A[Left],&A[Center]); }
if(A[Left] > A[Right]) { Swap(&A[Left],&A[Right]); }
if(A[Center] > A[Right]) { Swap(&A[Center],&A[Right]); } Swap(&A[Center],&A[Right-1]);
return A[Right-1];}
void QuickSort(int A[],int Left, int Right) { int Pivot, Low = 0, High = 0;
Pivot = Median3(A, Left, Right); Low = Left, High = Right-1;
while(1) ｛while(A[++Low] < Pivot); while(A[--High] > Pivot);
if(Low < High)
Swap(&A[Low],&A[High]);
else break; }
Swap(&A[Low],&A[Right-1]);
QuickSort(A, Left, Low-1);
QuickSort(A, Low+1, Right);}
void Println(int A[], int Len) {
int i = 0; for(i = 0; i < Len; i++) {
printf("%d ",A[i]);//
if(i != Len-1)// printf(" ");//注意IO流问题； }}

Answer 1

QuickSort 没有考虑left>=right情况

#include<stdlib.h>
#include <stdio.h>
#include <time.h>
#define N 100
void Swap(int *p, int *q);
int Median3(int A[], int Left, int Right);
void QuickSort(int A[], int Left, int Right);
void Println(int A[], int Len);
int main()
{
    int A[] = {4, 3, 2, 1, 6, 8};
    int i, len; //
    len = sizeof(A)/sizeof(int);
    // printf("请输入数组长度：\n");
    // scanf("%d", &len); // printf("请输入数组元素：\n");
    // for (i = 0; i < len; i++)
    // {
    //     scanf("%d", &A[i]);
    // }
    QuickSort(A, 0, len - 1);
    Println(A, len);
    system("pause");
}
void Swap(int *p, int *q)
{
    int temp = *p;
    *p = *q;
    *q = temp;
}
int Median3(int A[], int Left, int Right)
{
    int Center = (Left + Right) / 2;
    if (A[Left] > A[Center])
    {
        Swap(&A[Left], &A[Center]);
    }
    if (A[Left] > A[Right])
    {
        Swap(&A[Left], &A[Right]);
    }
    if (A[Center] > A[Right])
    {
        Swap(&A[Center], &A[Right]);
    }
    Swap(&A[Center], &A[Right - 1]);
    return A[Right - 1];
}
 
void QuickSort(int A[], int Left, int Right)
{
    if(Left>=Right) return;
    int Pivot, Low = 0, High = 0;
    Pivot = Median3(A, Left, Right);
    Low = Left, High = Right;
    while (Low<High){
        while(A[++Low] < Pivot);
        while (A[--High] > Pivot);      
        if (Low < High)
            Swap(&A[Low], &A[High]);       
    }
    QuickSort(A, Left, High);
    QuickSort(A, High+1, Right);
}
void Println(int A[], int Len)
{
    int i = 0;
    for (i = 0; i < Len; i++)
    {
        printf("%d ", A[i]); 
        if (i != Len - 1)    
            printf(" ");//注意IO流问题；
    }
}
/*
6
4 3 2 1 6 8
*/