C语言冒泡排序
int a[6] = {10, 75,7,90,4,200};
int z = 0;
for (int i = 0; i< 6; i++) {
for (int j = 0; j< 6-1-i ; j++) {
if (a[j] < a[j+1]) {
z = a[j];
a[j] = a[j+1];
a[j+1] = z;
}
}
}
for (int i = 0; i<6; i++) {
printf("%d ",a[i]);
}