几种排序方法

//几种排序的方法 #include<stdio.h>int main(){int a[k];int k;for(k = 0; k < n; k++);scanf("%d", &a[k]);//冒泡排序/*int i, j; for(i = 0; i < n; i++){for(j = 0; j < n - i; j++){if(a[j] > a[j + 1]){ina charge = a[j];a[j] = a[j + 1];a[j + 1] = charge;}}} *///插入排序/*for(int i = 0; i < n- 1; i++)for(int j = i + 1; j < n; j++){if(a[i] > a[j]){int temp = a[i];a[i] = a[j];a[j] = a[i];}}*/ return 0;} /*//快速排序void quicksort(int a[],int n){int i = 0; j = n - 1;int val = a[0];if(n > 1){while(i < j){//for 循环结束的条件 for(; j > i; j--){//从后向前搜索比val小的元素，找到后填到a[i]中并跳出循环if(a[j] < val){a[i] = a[j];break;}}for(; i < j; i++){if(a[i] > val){a[j] = a[i];break;}} }a[i] = val;quicksort(a, i);quicksort(a + i + 1, n - i - 1);}}*/