冒泡排序】
转
https://blog.csdn.net/dongming8886/article/details/123458790
供参考:
#include <stdio.h>
#define N 10
int main()
{
int a[N], i, j, t;
for (i = 0; i < N; i++)
scanf("%d", &a[i]);
for (j = 0; j < N - 1; j++)
{
for (i = 0; i < N - j - 1; i++) //for (i = 0; i < N - i - 1; i++)
{
if (a[i] > a[i + 1]) {
t = a[i];
a[i] = a[i + 1];
a[i + 1] = t;
}
}
}
for (i = 0; i < N; i++)
printf("%d ", a[i]);
return 0;
}
int main(){
int arr1[]={1,2,3,4,5,6};
int arr2[]={66,5,4,1,2,3};
// printf("%d",sizeof(arr2)/sizeof(arr2[0])); 打印数组长度
for(int i=0;i<sizeof(arr2);i++){
// 每轮寻找出当前最大值,最大值放到第i位,找出i和i后面的最大的值。 6654333
for(int j=i;j<sizeof(arr2)/sizeof(arr2[0]);j++){
if(arr2[i]<arr2[j]){
int temp=arr2[i];
arr2[i]=arr2[j];
arr2[j]=arr2[i];
}
}
}
for(int i=0;i<sizeof(arr2)/sizeof(arr2[0]);i++){
printf("%d,",arr2[i]);//打印数组
}
}