摘要: 冒泡排序 private static void bubble(int[] a) { int j = a.length - 1; do { int x = 0; for (int i = 0; i < j; i++) { if (a[i] > a[i + 1]) { int t = a[i]; a[ 阅读全文
posted @ 2025-04-27 10:38 陆陆无为而治者 阅读(23) 评论(0) 推荐(0)