#include <stdio.h>int main(){??? double arr[]={1.78, 1.77, 1.82, 1.79, 1.85, 1.75, 1.86, 1.77, 1.81, 1.80};??? int i,j;??? printf("\n************排隊前*************\n");??? for(i=0;i<10;i++)??? {??????? if(i != 9)?? ??????????? printf("%.2f, ", arr[i]);? //%.2f表示小數(shù)點后精確到兩位??????? else??????????? printf("%.2f", arr[i]);??? //%.2f表示小數(shù)點后精確到兩位??? }??? ??????? for(j=0;j<=9;j++)??????? {??????????? if(arr[j]>arr[j+1])????? //當(dāng)前面的數(shù)比后面的數(shù)大時??????????? {?????????????? double temp;??? //定義臨時變量temp??????????????? temp=arr[j];??? //將前面的數(shù)賦值給temp??????????????? arr[j]=arr[j+1];????????????? //前后之?dāng)?shù)顛倒位置??????????????? arr[j+1]=temp;???? ??????????? } ??????????? else??????????? {}??????? }??????????????? ??? ??? printf("\n************排隊后*************\n");??? for(i=0;i<10;i++)??? {??????? if(i != 9)?? ??????????? printf("%.2f, ", arr[i]);? //%.2f表示小數(shù)點后精確到兩位???? ??????? else??????????? printf("%.2f", arr[i]);??? //%.2f表示小數(shù)點后精確到兩位??? }??? return 0;??? }這樣為什么不是冒泡排序
2 回答
已采納

qq___524
TA貢獻(xiàn)171條經(jīng)驗 獲得超74個贊
void?bubble_sort(int?a[],?int?n) { ????int?i,?j,?temp; ????for?(j?=?0;?j?<?n?-?1;?j++) ????????for?(i?=?0;?i?<?n?-?1?-?j;?i++) ????????{ ????????????if(a[i]?>?a[i?+?1]) ????????????{ ????????????????temp?=?a[i]; ????????????????a[i]?=?a[i?+?1]; ????????????????a[i?+?1]?=?temp; ????????????} ????????} }
這是冒泡排序,兩層循環(huán)
- 2 回答
- 0 關(guān)注
- 1461 瀏覽
添加回答
舉報
0/150
提交
取消