冒泡排序

来源：互联网发布：京东数据罗盘免费版编辑：程序博客网时间：2024/05/21 15:04
public class SortTest {public static void main(String[] args) {System.out.println("###方法1###");Fun1();System.out.println("###方法2###");Fun2();}public static void Fun1() {/** * 实现冒泡程序1 */int[] numb = new int[] { 3, 42, 57, 1, 32, 24 };int len = numb.length;int i, j;int temp;System.out.println("排序前的数组各个值:");for (i = 0; i < len; i++){System.out.print(numb[i] + "\t");}System.out.println("\n");/* ============================ 核心一 ============================ */for (i = 1; i <= len; i++){for (j = len - 1; j >= 1; j--){if (numb[j] > numb[j - 1]){temp = numb[j];numb[j] = numb[j - 1];numb[j - 1] = temp;}}}System.out.println("排序后的数组各个值:");for (i = 0; i < len; i++){System.out.print(numb[i] + "\t");}}public static void Fun2() {/** * 实现冒泡程序2 */int[] numb = new int[] { 3, 42, 57, 1, 32, 24 };int leng = numb.length;System.out.println("排序前的数组各个值:");for (int i = 0; i < leng; i++){System.out.print(numb[i] + "\t");}System.out.println("\n");/* ============================ 核心二 ============================ */swap(numb);System.out.println("数组排序后:");for (int i = 0; i < leng; i++) {System.out.print(numb[i] + "\t");}}private static int[] swap(int[] numb) {int n2[] = numb;int len = n2.length;int i, j;int temp;for (i = 1; i <= len; i++) {for (j = len - 1; j >= 1; j--) {if (n2[j] > n2[j - 1]) {temp = n2[j];n2[j] = n2[j - 1];n2[j - 1] = temp;}}}return n2;}}
0 0