//冒泡排序来实现降序排列
#define _CRT_SECURE_NO_WARNINGS 1
void bubble_scord(int arr[], int sz)
{
int i = 0;
int j = 0;
for (i = 0; i < sz - 1; i++)
{
for(j = 0;j<sz-1-i;j++)
if (arr[j] < arr[j + 1])
{
int tmp = 0;
tmp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tmp;
}
}
}
int main()
{
int arr[] = { 10,1,2,3,4,5,6,7,8,90 };
int sz = sizeof(arr) / sizeof(arr[0]);
bubble_scord(arr, sz);
return 0;
}