歡迎討論 回復 哪個算法+原因 即可
package Sort;public class Sort { /** * 算法A */ public static void sortA() { int a[] = { 10, 2, 3, 6, 5, 4, 9, 7, 1, 8 }; for (int i = 0; i <=a.length - 1; i++) { for (int j = i + 1; j<=a.length - 1; j++) { if (a[j] <= a[i]) { int c = a[i]; a[i] = a[j]; a[j] = c; } } } for (int i = 0; i <= a.length - 1; i++) { System.out.PRintln(a[i]); } } /** * 算法B */ public static void sortB() { int a[] = { 10, 2, 3, 6, 5, 4, 9, 7, 1, 8 }; for (int i = 0; i <=a.length - 1; i++) { for (int j = 0; j< a.length - 1 - i; j++) { if (a[j] >a[j+1]) { int c = a[j]; a[j] = a[j+1]; a[j+1] = c; } } } for (int i = 0; i <= a.length - 1; i++) { System.out.println(a[i]); } } /** * 算法C */ public static void sortC(){ int a[] = { 10, 2, 3, 6, 5, 4, 9, 7, 1, 8 }; int length = a.length; while(true) { boolean isEnd = true; for(int i = 0; i < length - 1 ; i++) { // 標識是否全部交換完畢 int before = a[i]; int behind = a[i + 1]; if(behind < before) { // 如果后面數的值<前面數的值，則交換 a[i] = behind; a[i + 1] = before; isEnd = false; // 沒有交換完畢 continue; } else if (i == length - 1) { // 如果最后一個人元素的場合下 還沒有發生可以交換的事件 isEnd = true; } } if(isEnd) {break;} } for(int n : a) { System.out.print(n + ", "); } } public static void main(String[] args) { Sort.sortA(); Sort.sortB(); Sort.sortC(); } }新聞熱點
疑難解答
