六种排序算法C语言实现源代码

#include <stdio.h> #include "stdlib.h" int num[]={12,34,54,765,235,24,8,9,456,342}; void printArray(int * num,int length); int * sortByMaopao(int * num,int length); int * sortByCharu(int * num,int length); int * sortByGuibing(int * num,int length); int * sortByKuaisu(int * num,int length); int * sortByXier(int * num,int length); int * sortByXuanze(int *num,int length); void runMaopao() { printf("before Maopao:\n"); printArray(num,10); sortByMaopao(num,10); printf("after Maopao:\n"); printArray(num,10); } void runCharu() { printf("before Charu:\n"); printArray(num,10); sortByCharu(num,10); printf("after Charu:\n"); printArray(num,10); } void runGuibing() { printf("before Guibing:\n"); printArray(num,10); sortByGuibing(num,10); printf("after Guibing:\n"); printArray(num,10); } void runKuaisu() { printf("before Kuaisu:\n"); printArray(num,10); sortByKuaisu(num,10); printf("after Kuaisu:\n"); printArray(num,10); } void runXier() { printf("before Xier:\n"); printArray(num,10); sortByXier(num,10); printf("after Xier:\n"); printArray(num,10); } void runXuanze() { printf("before Xuanze:\n"); printArray(num,10); sortByXuanze(num,10); printf("after Xuanze:\n"); printArray(num,10); } void main() { //runMaopao(); //runCharu(); //runGuibing(); //runKuaisu(); //runXier(); runXuanze(); }