数组冒泡排序

题目见C++第14周项目4——数组的排序

#include <stdio.h> void bubble_sort (int [],int );void output_array (int [],int );void main(){int a[20]={86,76,62,58,77,85,92,80,96,88,77,67,80,68,88,87,64,59,61,76};int b[15]={27,61,49,88,4,20,28,31,42,62,64,14,88,27,73};bubble_sort(a,20); //用冒泡法按降序排序a 中元素output_array(a,20); //输出排序后的数组bubble_sort(b,15); //用冒泡法按降序排序b 中元素output_array(b,15); //输出排序后的数组}void bubble_sort (int shuzu[],int num){int i,j,t;for (i=0;i<num;i++){for (j=0;j<num-i;j++){if (shuzu[j]>shuzu[j+1]){t=shuzu[j];shuzu[j]=shuzu[j+1];shuzu[j+1]=t;}}}return ;}void output_array (int shuzu[],int num){int i;for (i=0;i<num;i++){printf("%d ",shuzu[i]);}printf("\n");return ;}