001.冒泡演算法
阿新 • • 發佈:2022-03-20
package com.lll.demo; import javax.sound.midi.Soundbank; public class Demo5 { public static void main(String[] args) { int number[] = {9, 7, 5, 3, 1, 10, 8, 6, 4, 2}; // System.out.println(number.length); for (int i = 0; i < number.length - 1; i++) {//比較趟數,需要走元素個數減去一 booleanswap = false; for (int j = 0; j < number.length - i - 1; j++)//比較次數(number.length - i)是每趟的比較次數,減一是為了不讓number[j + 1]下標越界 { if (number[j] > number[j + 1]) { int temp = number[j]; number[j] = number[j + 1]; number[j+ 1] = temp; swap = true; } } if (!swap)//陣列已經有序 { break; } } for (int i = 0;i <10 ; ++i) { System.out.print(" "+number[i]); } } }