冒泡、插入、归并排序

package com.yan.test;

public class Test15 {

    public static void main(String[] args) {
        System.out.println("1、冒泡排序");
        int[] bubble = new int[10];

        for (int i=0;i<bubble.length;i++){
            bubble[i] = (int)(Math.random()*100+1);
        }

        for(int b:bubble){
            System.out.print(b+" ");
        }
        System.out.println();

        for(int i=0;i<bubble.length;i++){
            for(int j=0;j<bubble.length-i-1;j++){
                if (bubble[j]>bubble[j+1]){
                    int temp = bubble[j];
                    bubble[j] = bubble[j+1];
                    bubble[j+1] = temp;
                }
            }
        }

        for(int b:bubble){
            System.out.print(b+" ");
        }

        System.out.println();
        System.out.println("2、插入排序");

        int[] insertSort1 = new int[10];
        int[] insertSort2 = new int[10];
        for (int i=0;i<insertSort1.length;i++){
            insertSort1[i] = (int)(Math.random()*100+1);
            insertSort2[i] = (int)(Math.random()*100+1);
        }

        for(int i1:insertSort1){
            System.out.print(i1+" ");
        }
        System.out.println();
        for(int i2:insertSort2){
            System.out.print(i2+" ");
        }
        System.out.println();

        for(int i=1;i<insertSort1.length;i++){
            for(int j=i;j>0;j--){
                if (insertSort1[j]<insertSort1[j-1]){
                    int tmp = insertSort1[j];
                    insertSort1[j] = insertSort1[j-1];
                    insertSort1[j-1] = tmp;
                }else {
                    break;
                }
            }
        }

        System.out.println("insertSort1插入排序后");
        for(int i1:insertSort1){
            System.out.print(i1+" ");
        }
        System.out.println();

        int[] insertSort = new int[20];
        for (int i=0;i<10;i++){
            insertSort[i] = insertSort1[i];
        }
        for(int i:insertSort){
            System.out.print(i+" ");
        }
        System.out.println();
        for (int i = 9; i < insertSort.length;) {
            for (int k = 0; k < insertSort2.length; k++) {
                for (int j = i; j >= 0; j--) {
                    if (insertSort2[k] < insertSort[j]) {
                        insertSort[j + 1] = insertSort[j];
                        insertSort[j] = insertSort2[k];
                    } else {
                        insertSort[j + 1] = insertSort2[k];
                        break;
                    }
                }
                i++;
            }
            if(i==insertSort.length-1) {
                break;
            }
        }

        System.out.println("插入排序后");
        for (int i : insertSort) {
            System.out.print(i + " ");
        }

        System.out.println();
        System.out.println("3、归并排序");

        int[] mergeSort1 = new int[10];
        int[] mergeSort2 = new int[10];

        for (int i=0;i<mergeSort1.length;i++){
            mergeSort1[i] = (int)(Math.random()*100+1);
            mergeSort2[i] = (int)(Math.random()*100+1);
        }

        for(int i1:insertSort1){
            System.out.print(i1+" ");
        }
        System.out.println();
        for(int i2:insertSort2){
            System.out.print(i2+" ");
        }
        System.out.println();
        System.out.println("分别排序后");

        for(int i=1;i<mergeSort1.length;i++){
            for(int j=i;j>0;j--){
                if (mergeSort1[j]<mergeSort1[j-1]){
                    int tmp = mergeSort1[j];
                    mergeSort1[j] = mergeSort1[j-1];
                    mergeSort1[j-1] = tmp;
                }else {
                    break;
                }
            }
        }

        for(int i=1;i<mergeSort2.length;i++){
            for(int j=i;j>0;j--){
                if (mergeSort2[j]<mergeSort2[j-1]){
                    int tmp = mergeSort2[j];
                    mergeSort2[j] = mergeSort2[j-1];
                    mergeSort2[j-1] = tmp;
                }else {
                    break;
                }
            }
        }

        for(int m1:mergeSort1){
            System.out.print(m1+" ");
        }
        System.out.println();
        for(int m2:mergeSort2){
            System.out.print(m2+" ");
        }
        System.out.println();

        int k=0,s=0;
        int i=0;
        int[] temp = new int[20];
        for(i=0;s<=9&&i<=9;++k){
            if (mergeSort1[s]<mergeSort2[i]){
                temp[k] = mergeSort1[s++];
            }else {
                temp[k] = mergeSort2[i++];
            }
        }
        for (;s<=9;++k){
            temp[k] = mergeSort1[s++];
        }
        for (;i<=9;++k){
            temp[k] = mergeSort2[i++];
        }
        System.out.println("合并后");
        for(int t:temp){
            System.out.print(t+" ");
        }
    }
}