编辑代码

#include <stdio.h>
int main () {
     int a[8] = {49,38,65,97,76,13,27,49};
    Quicksort(a,0,7);
    print_arr(a,8);

	return 0;
}

void print_arr(int a[], int n){
   for(int i = 0 ; i < n ; i++){
       printf("%d ",a[i]);
   }
   printf("\n");
}

//冒泡排序
void Bubblesort(int a[],int n){
    int temp;
    for(int i = 0 ; i < n ; i++){
        for(int j = 0 ; j < n-i ; j++){
            if(j+1<n&&a[j] > a[j+1]){
                temp = a[j+1];
                a[j+1] = a[j];
                a[j] = temp;
            }
        }
        print_arr(a,n);
    }
}

//快速排序
void Quicksort(int a[],int low , int high){
    if(low >= high) return ;
    int temp = a[low];
    int low1 = low;
    int high1 = high;
    while(low1 < high1){
        while(low1 < high1&&a[high1]>=temp) high1--;
        a[low1] = a[high1];
        while(low1 < high1&&a[low1] <= temp) low1++;
        a[high1] = a[low1];
    }
    a[low1] = temp;
    Quicksort(a,low,low1-1);
    Quicksort(a,high1+1,high);
    return ;

}