冒泡排序算法C语言
#include<stdio.h>
#include<stdlib.h>
#define LENGTH 10
void MaoPao(int s[])
{
int j=0,flag = 1;
while (j <LENGTH && flag == 1)//共比较n-1次,若不发生交换则数组已有序
{
flag = 0;//判断是否发生交换
for (int i = 0; i < LENGTH-1- j; i++)//每次比较n-1-j次
if (s[i] < s[i + 1])
{
int t = s[i + 1];
s[i + 1] = s[i];
s[i] = t;
flag = 1;
}
j++;
}
}
void main()
{
int a[20];
for(int i=0;i<LENGTH;i++)
a[i]=rand()%100;
MaoPao(a);
for(int i=0;i<LENGTH;i++)
printf("%d\n",a[i]);
}