生活随笔
收集整理的這篇文章主要介紹了
java算法：冒泡排序
小編覺得挺不錯的,現在分享給大家,幫大家做個參考.
java算法：冒泡排序
冒泡排序：不斷遍歷文件，交換倒序的相鄰元素，直到文件排好順序。冒泡排序的主要優點是容易實現，冒泡排序通常會比選擇排序、插入排序慢。
如，對EXAMPLE 字母進行排序：
?E?? X?? A?? M?? P?? L?? E?? .開始
[A]? E?? X? [E]? M?? P?? L?? .E移到了A之后，A移到了最前面
?A?? E? [E]? X?? L?? M?? P?? .L移到了E之后，E移到了X前面
?A?? E?? E? [L]? X?? M?? P?? .L移到了X前面
?A?? E?? E?? L? [M]? X?? P?? ...
?A?? E?? E?? L?? M? [P]? X???
?A?? E?? E?? L?? M?? P? [X]
Prettyprint java代碼
public?class?Bubble?{ ????????public?static?void?main(String[]?args)?{ ??????????int?n?=?20; ??????????MyItem?[]?a?=?new?MyItem[n]; ??????????for?(int?i?=?0;?i?<?n;?i++)?{ ??????????????a[i]?=?new?MyItem(); ??????????????a[i].rand(); ??????????} ?????????? ??????????for?(int?i?=?0;?i?<?n;?i++)?{ ??????????????System.out.print(a[i]?+?"?"); ??????????} ?????????? ??????????bubble(a,?0,?n); ??????????System.out.println(""); ??????????print(a,?n); ??????} ?????? ??????private?static?void?print(MyItem?a?[],?int?n){ ??????????for?(int?i?=?0;?i?<?n;?i++)?{ ??????????????System.out.print(a[i]?+?"?"); ??????????} ??????} ?????? ??????public?static?void?bubble(MyItem?[]?a,?int?l,?int?r){ ??????????for?(int?i?=?l;?i?<?r;?i++)?{ ??????????????for?(int?j?=?r?-?1;?j?>?i;?j--)?{ ??????????????????compExch(a,?j?-?1,?j); ??????????????} ??????????} ??????} ?????? ??????public?static?boolean?less(Item?v,?Item?w){ ??????????return?v.less(w); ??????} ?????? ??????public?static?void?exch(Item?[]?a,?int?i,?int?j){ ??????????Item?t?=?a[i]; ??????????a[i]?=?a[j]; ??????????a[j]?=?t; ??????} ?????? ??????public?static?void?compExch(Item?[]?a,?int?i,?int?j){ ??????????if(less(a[j],a[i])){ ??????????????exch(a,?i,?j); ??????????} ??????} ??}??
轉載于:https://www.cnblogs.com/wuyida/archive/2012/11/01/6301140.html
總結
以上是生活随笔為你收集整理的java算法：冒泡排序的全部內容，希望文章能夠幫你解決所遇到的問題。
如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。
