void bubble_sort(int a[], int n)
{
int i, j, t
for (i = 0i <n - 1i++)
for (j = 0j <n - 1 - ij++)
if(a[j] <a[j + 1])
{
t=a[j]
a[j]=a[j+1]
a[j+1]=t
}
}
int main()
{
int number[10] = {95, 45, 15, 78, 84, 51, 24, 12, 38, 97}
int i,SIZE=10
bubble_sort(number, SIZE)
for (i = 0i <SIZEi++)
printf("%d ", number[i])
printf("\n")
}
C语言代码和运行结果如下:
可见成功按从大到小排序,望采纳~
附源码:
#include <stdio.h>
void sort(int a[], int n) {
int i, j, t
for (i = 0i <n - 1i++) {
for (j = 0j <n - 1 - ij++)
if (a[j] <a[j + 1]) { // 将小数交换到后面
t = a[j]
a[j] = a[j + 1]
a[j + 1] = t
}
}
}
void display(int a[], int n) {
int i
for (i = 0i <ni++)
printf("%d ", a[i])
printf("\n")
}
int main() {
int a[] = {1,3,2,8,0,6}
int n = sizeof(a) / sizeof(a[0])
printf("从大到小冒泡排序:\n")
sort(a, n)
display(a, n)
return 0
}