冒泡排序與二分發查找代碼與解析

冒泡排序 public class Arryss { public static void main(String[] args) { int [] num = {2,5,33,21,32,47,23,17}; //創建一個無序數組 for (int i = 0; i < num.length-1; i++) { //外層循環決定遍歷幾輪 for (int j =

>>阅读原文<<