C语言 冒泡排序复习

# include <stdio.h># include <malloc.h>void movput(int* q, int len)//1.给数组分配一个动态空间{q= (int*)malloc(sizeof(int)*len);}void input(int* p, int len)//2.让用户输入要比较的数字{for(int i=0; i<len; ++i){printf("请输入第%d个元素:",i+1);scanf("%d",&p[i]);}}void sort(int* p,int len)//3.把输入的数字排序{int i, j, t;for(i=1; i<len; ++i){for(j=0; j<len-i; ++j){if (p[j] < p[j+1]){t = p[j];p[j] = p[j+1];p[j+1] = t;}}}}void prt(int* p,int len) //4.输出排序后的数字{for(int i=0; i<len; ++i)printf("%d ",p[i]);}int main(void){int a[5]; //定义一个数组movput(a,5); //给数组分配一个动态空间input(a,5); //让用户输入要比较的数字sort(a,5); //把输入的数字排序prt(a,5); //输出排序后的数字free(a); //释放 a 数组所占空间return 0;}