#include <stdio.h>
#define SIZE 10
int main()
{
int temp,x,i,j,y;
int arr[SIZE] = { 10,7,1,5,2,4,6,3,8,9 };
for ( x = 0; x < SIZE; x++)
{
printf("原数组为:%d \n", arr[x]);
}
for ( i = 0; i < SIZE - 1; i++)
{
for ( j = 0; j < SIZE - i - 1; j++)
{
if (arr[j] > arr[j + 1])
{
temp = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = temp;
}
}
}
for ( y = 0; y < SIZE; y++)
{
printf("排序之后的数组为:%d \n", arr[y]);
}
return 0;
}
冒泡排序
最新推荐文章于 2024-10-01 23:05:47 发布