#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<assert.h>
//冒泡排序(大到小)
void bubble_sort(int* arr1, int sz1)
{
assert(arr1);
int i = 0;
for (i = 0; i < sz1 - 1; i++)
{
int j = 0;
for (j = 0; j < sz1 - i - 1; j++)
{
if (*(arr1 + j) < *(arr1 + j + 1))
{
int tmp = *(arr1 + j);
*(arr1 + j) = *(arr1 + j + 1);
*(arr1 + j + 1) = tmp;
}
}
}
}
void print_arr(int arr[], int sz)
{
int i = 0;
for (i = 0; i < sz; i++)
{
printf("%d ", arr[i]);
}
}
int main()
{
int arr[10] = { 1,3,5,7,9,2,4,6,8,0 };
int sz = sizeof(arr) / sizeof(arr[0]);
bubble_sort(arr, sz);
print_arr(arr, sz);
return 0;
}
vs2019冒泡排序
于 2023-06-17 16:26:56 首次发布